{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:59:24Z","timestamp":1648983564853},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T00:00:00Z","timestamp":1405036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11590-014-0763-5","type":"journal-article","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T11:14:46Z","timestamp":1404990886000},"page":"19-39","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["RLT insights into lift-and-project closures"],"prefix":"10.1007","volume":"9","author":[{"given":"Warren P.","family":"Adams","sequence":"first","affiliation":[]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,11]]},"reference":[{"issue":"1","key":"763_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(92)00119-7","volume":"48","author":"WP Adams","year":"1994","unstructured":"Adams, W.P., Dearing, P.M.: On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems. Discret. Appl. Math. 48(1), 1\u201320 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"763_CR2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"WP Adams","year":"2004","unstructured":"Adams, W.P., Forrester, R.J., Glover, F.W.: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs. Discret. Optim. 1(2), 99\u2013120 (2004)","journal-title":"Discret. Optim."},{"issue":"3","key":"763_CR3","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1016\/j.ejor.2006.03.051","volume":"180","author":"WP Adams","year":"2007","unstructured":"Adams, W.P., Guignard, M., Hahn, P.M., Hightower, W.L.: A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur. J. Oper. Res. 180(3), 983\u2013996 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"763_CR4","doi-asserted-by":"crossref","first-page":"2142","DOI":"10.1016\/j.dam.2007.08.035","volume":"156","author":"WP Adams","year":"2008","unstructured":"Adams, W.P., Hadavas, P.T.: A network approach for specially-structured linear programs arising in 0-1 quadratic optimization. Discret. Appl. Math. 156(11), 2142\u20132165 (2008)","journal-title":"Discret. Appl. Math."},{"key":"763_CR5","doi-asserted-by":"crossref","unstructured":"Adams, W.P., Johnson, T.A.: Improved linear programming-based bounds for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series, vol. 16, pp. 43\u201375. AMS (1994)","DOI":"10.1090\/dimacs\/016\/02"},{"issue":"10","key":"763_CR6","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32(10), 1274\u20131290 (1986)","journal-title":"Manag. Sci."},{"issue":"2","key":"763_CR7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"WP Adams","year":"1990","unstructured":"Adams, W.P., Sherali, H.D.: Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38(2), 217\u2013226 (1990)","journal-title":"Oper. Res."},{"issue":"3","key":"763_CR8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"WP Adams","year":"1993","unstructured":"Adams, W.P., Sherali, H.D.: Mixed-integer bilinear programming problems. Math. Progr. 59(3), 279\u2013305 (1993)","journal-title":"Math. Progr."},{"issue":"1","key":"763_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10479-005-3966-4","volume":"140","author":"WP Adams","year":"2005","unstructured":"Adams, W.P., Sherali, H.D.: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems. Ann. Oper. Res. 140(1), 21\u201347 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"763_CR10","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebr. Discret. Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"issue":"3","key":"763_CR11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Progr. 58(3), 295\u2013324 (1993)","journal-title":"Math. Progr."},{"issue":"9","key":"763_CR12","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Manag. Sci. 42(9), 1229\u20131246 (1996)","journal-title":"Manag. Sci."},{"issue":"4","key":"763_CR13","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.orl.2005.07.001","volume":"34","author":"P Bonami","year":"2006","unstructured":"Bonami, P., Minoux, M.: Exact MAX-2SAT solution via lift-and-project closure. Oper. Res. Lett. 34(4), 387\u2013393 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"763_CR14","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.disopt.2005.08.006","volume":"2","author":"P Bonami","year":"2005","unstructured":"Bonami, P., Minoux, M.: Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. Discret. Optim. 2(4), 288\u2013307 (2005)","journal-title":"Discret. Optim."},{"issue":"1","key":"763_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/nav.3800250111","volume":"25","author":"RE Burkard","year":"1978","unstructured":"Burkard, R.E., Stratmann, K.H.: Numerical investigations on quadratic assignment problems. Naval Res. Logist. Q. 25(1), 129\u2013148 (1978)","journal-title":"Naval Res. Logist. Q."},{"issue":"1","key":"763_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28(1), 1\u20138 (2001)","journal-title":"Oper. Res. Lett."},{"key":"763_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0120905","volume":"13","author":"CS Edwards","year":"1980","unstructured":"Edwards, C.S.: A branch and bound algorithm for the Koopmans\u2013Beckmann quadratic assignment problem. Math. Progr. Study 13, 35\u201353 (1980)","journal-title":"Math. Progr. Study"},{"key":"763_CR18","unstructured":"Fortet, R.: L\u2019alg\u00e8bre de Boole et ses applications en recherche op\u00e9rationnelle. Cahiers du Centre d\u2019\u00c9tudes de Rec. Op\u00e9rationnelle, vol. 1, pp. 5\u201336 (1959)"},{"key":"763_CR19","unstructured":"Fortet, R.: Applications de l\u2019alg\u00e8bre de Boole en recherche op\u00e9rationnelle. Rev. Fran\u00e7aise Informatique Recherche Op\u00e9r, vol. 4, pp. 17\u201326 (1960)"},{"issue":"1","key":"763_CR20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0166-218X(83)90018-5","volume":"5","author":"AM Frieze","year":"1983","unstructured":"Frieze, A.M., Yadegar, J.: On the quadratic assignment problem. Discret. Appl. Math. 5(1), 89\u201398 (1983)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"763_CR21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0110022","volume":"10","author":"PC Gilmore","year":"1962","unstructured":"Gilmore, P.C.: Optimal and suboptimal algorithms for the quadratic assignment problem. J. Soc. Ind. Appl. Math. 10(2), 305\u2013313 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"4","key":"763_CR22","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer programs. Manag. Sci. 22(4), 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"issue":"1","key":"763_CR23","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0-1 polynomial programming problem to a 0-1 linear program. Oper. Res. 22(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"issue":"6","key":"763_CR24","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1287\/opre.46.6.912","volume":"46","author":"P Hahn","year":"1998","unstructured":"Hahn, P., Grant, T.: Lower bounds for the quadratic assignment problem based upon a dual formulation. Oper. Res. 46(6), 912\u2013922 (1998)","journal-title":"Oper. Res."},{"issue":"3","key":"763_CR25","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(97)00063-5","volume":"108","author":"PM Hahn","year":"1998","unstructured":"Hahn, P.M., Grant, T.L., Hall, N.: A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method. Eur. J. Oper. Res. 108(3), 629\u2013640 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"763_CR26","first-page":"41","volume":"11","author":"P Hahn","year":"2001","unstructured":"Hahn, P., Hightower, W., Johnson, T.A., Guignard-Spielberg, M.: Tree elaboration strategies in branch and bound algorithms for solving the quadratic assignment problem. Yugosl. J. Oper. Res. 11(1), 41\u201360 (2001)","journal-title":"Yugosl. J. Oper. Res."},{"issue":"5\/6","key":"763_CR27","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1023\/A:1012252420779","volume":"12","author":"P Hahn","year":"2001","unstructured":"Hahn, P., Krarup, J.: A hospital facility problem finally solved. J. Intell. Manufact. 12(5\/6), 487\u2013496 (2001)","journal-title":"J. Intell. Manufact."},{"issue":"2","key":"763_CR28","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/ijoc.1110.0450","volume":"24","author":"PM Hahn","year":"2012","unstructured":"Hahn, P.M., Zhu, Y.-R., Guignard, M., Hightower, W.L., Saltzman, M.J.: A level-3 reformulation-linearization technique bound for the quadratic assignment problem. INFORMS J. Comput. 24(2), 202\u2013209 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"763_CR29","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2307\/1907742","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25(1), 53\u201376 (1957)","journal-title":"Econometrica"},{"issue":"4","key":"763_CR30","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"19","author":"E Lawler","year":"1963","unstructured":"Lawler, E.: The quadratic assignment problem. Manag. Sci. 19(4), 586\u2013599 (1963)","journal-title":"Manag. Sci."},{"issue":"1","key":"763_CR31","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02085649","volume":"50","author":"Y Lee","year":"1994","unstructured":"Lee, Y., Pardalos, P.M., Ramakrishnan, K.G., Resende, M.G.C.: Lower bounds for the quadratic assignment problem. Ann. Oper. Res. 50(1), 387\u2013410 (1994)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"763_CR32","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10479-005-3452-z","volume":"139","author":"R Lougee-Heimer","year":"2005","unstructured":"Lougee-Heimer, R., Adams, W.P.: A conditional logic approach for strengthening mixed 0-1 linear programs. Ann. Oper. Res. 139(1), 289\u2013320 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"18","key":"763_CR33","doi-asserted-by":"crossref","first-page":"2031","DOI":"10.1016\/j.dam.2010.08.020","volume":"158","author":"M Minoux","year":"2010","unstructured":"Minoux, M., Ouzia, H.: DRL*: a hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs. Discret. Appl. Math. 158(18), 2031\u20132048 (2010)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"763_CR34","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/opre.16.1.150","volume":"6","author":"CE Nugent","year":"1968","unstructured":"Nugent, C.E., Vollman, T.E., Ruml, J.: An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. 6(1), 150\u2013173 (1968)","journal-title":"Oper. Res."},{"key":"763_CR35","first-page":"185","volume":"32","author":"C Roucairol","year":"1979","unstructured":"Roucairol, C.: A reduction method for quadratic assignment problems. Oper. Res. Verfahr. Methods Oper. Res. 32, 185\u2013187 (1979)","journal-title":"Oper. Res. Verfahr. Methods Oper. Res."},{"issue":"3","key":"763_CR36","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discret. Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discret. Math."},{"key":"763_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation\u2013Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation\u2013Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"1","key":"763_CR38","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discret. Appl. Math. 52(1), 83\u2013106 (1994)","journal-title":"Discret. Appl. Math."},{"key":"763_CR39","unstructured":"Sun, X: Combinatorial algorithms for Boolean and pseudo-Boolean functions. PhD Dissertation, Rutgers University (1992)"},{"issue":"3","key":"763_CR40","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1287\/opre.46.3.396","volume":"46","author":"HD Sherali","year":"1998","unstructured":"Sherali, H.D., Adams, W.P., Driscoll, P.J.: Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Oper. Res. 46(3), 396\u2013405 (1998)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"763_CR41","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(95)00060-5","volume":"68","author":"HD Sherali","year":"1996","unstructured":"Sherali, H.D., Lee, Y.: Tighter representations for set partitioning problems. Discret. Appl. Math. 68(1\u20132), 153\u2013167 (1996)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"763_CR42","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","volume":"12","author":"LE Trotter","year":"1975","unstructured":"Trotter, L.E.: A class of facet producing graphs for vertex packing polyhedra. Discret. Math. 12(4), 373\u2013388 (1975)","journal-title":"Discret. Math."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0763-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0763-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0763-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T13:34:01Z","timestamp":1565616841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0763-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,11]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["763"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0763-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,11]]}}}