{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T13:20:45Z","timestamp":1721827245909},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0166-218x(99)00225-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:44:34Z","timestamp":1027633474000},"page":"247-267","source":"Crossref","is-referenced-by-count":16,"title":["Reduced first-level representations via the reformulation-linearization technique: results, counterexamples, and computations"],"prefix":"10.1016","volume":"101","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan C.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warren P.","family":"Adams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00225-5_BIB1","doi-asserted-by":"crossref","unstructured":"W.P. Adams, T.A. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem, in: P.M. Pardalos, H. Wolkowicz (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Quadratic Assignment and Related Problems, Vol. 16, American Mathematical Society, Providence, RI, 1994, pp. 43\u201375.","DOI":"10.1090\/dimacs\/016\/02"},{"issue":"10","key":"10.1016\/S0166-218X(99)00225-5_BIB2","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","article-title":"A tight linearization and an algorithm for zero-one quadratic programming problems","volume":"32","author":"Adams","year":"1986","journal-title":"Management Sci."},{"issue":"3","key":"10.1016\/S0166-218X(99)00225-5_BIB3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","article-title":"Mixed-integer bilinear programming problems","volume":"59","author":"Adams","year":"1993","journal-title":"Math. Programming"},{"issue":"3","key":"10.1016\/S0166-218X(99)00225-5_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane algorithm for mixed 0\u20131 programs","volume":"58","author":"Balas","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/S0166-218X(99)00225-5_BIB5","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","article-title":"Mixed integer 0\u20131 programming by lift-and-project in a branch-and-bound framework","volume":"42","author":"Balas","year":"1996","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(99)00225-5_BIB6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584228","article-title":"A restricted Lagrangian approach to the traveling salesman problem","volume":"21","author":"Balas","year":"1981","journal-title":"Math. Programming"},{"issue":"2","key":"10.1016\/S0166-218X(99)00225-5_BIB7","first-page":"16","article-title":"MIPLIB: a test set of mixed integer programming problems","volume":"25","author":"Bixby","year":"1992","journal-title":"SIAM News"},{"key":"10.1016\/S0166-218X(99)00225-5_BIB8","first-page":"12","article-title":"An updated mixed integer programming library: MIPLIB 3.0","volume":"58","author":"Bixby","year":"1998","journal-title":"Optima"},{"key":"10.1016\/S0166-218X(99)00225-5_BIB9","unstructured":"V. Chv\u00e1tal, Linear programming, W.H. Freeman, New York, 1983."},{"key":"10.1016\/S0166-218X(99)00225-5_BIB10","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","article-title":"Cones of matrices and set-functions and 0\u20131 optimization","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0166-218X(99)00225-5_BIB11","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser, L.A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.","DOI":"10.1002\/9781118627372"},{"key":"10.1016\/S0166-218X(99)00225-5_BIB12","doi-asserted-by":"crossref","unstructured":"B. Ramachandran, J.F. Pekny, Dynamic factorization methods for using formulations derived from higher order lifting techniques in the solution of the quadratic assignment problem, in: C.A. Floudas, P.M. Pardalos (Eds.), State of the Art in Global Optimization, Vol. 7, Kluwer Academic Publishers, Dordrecht, 1996, pp. 75\u201392.","DOI":"10.1007\/978-1-4613-3437-8_6"},{"key":"10.1016\/S0166-218X(99)00225-5_BIB13","doi-asserted-by":"crossref","unstructured":"K.G. Ramakrishnan, M.G.C. Resende, P.M. Pardalos, A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming, in: C.A. Floudas, P.M. Pardalos (Eds.), State of the Art in Global Optimization, Vol. 7, Kluwer Academic Publishers, Dordrecht, 1996, pp. 57\u201374.","DOI":"10.1007\/978-1-4613-3437-8_5"},{"issue":"4","key":"10.1016\/S0166-218X(99)00225-5_BIB14","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1287\/opre.32.4.878","article-title":"A decomposition algorithm for a discrete location\u2013allocation problem","volume":"32","author":"Sherali","year":"1984","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/S0166-218X(99)00225-5_BIB15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(99)00225-5_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","article-title":"A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems","volume":"52","author":"Sherali","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00225-5_BIB17","doi-asserted-by":"crossref","unstructured":"H.D. Sherali, E.L. Brown, A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem, in: P.M. Pardalos, H. Wolkowicz (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Quadratic Assignment and Related Problems, Vol. 16, American Mathematical Society, Providence, RI, 1994, pp. 343\u2013364.","DOI":"10.1090\/dimacs\/016\/17"},{"key":"10.1016\/S0166-218X(99)00225-5_BIB18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(95)00060-5","article-title":"Tighter representations for set partitioning problems","volume":"68","author":"Sherali","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00225-5_BIB19","first-page":"393","article-title":"Lagrange multipliers in integer programming","volume":"7","author":"Vizv\u00e1ri","year":"1978","journal-title":"Problems Control Inform. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T07:24:20Z","timestamp":1555313060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0166218X99002255"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00225-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}