{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T09:41:16Z","timestamp":1790934076754,"version":"4.1.0"},"reference-count":26,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1051\/ro:2008011","type":"journal-article","created":{"date-parts":[[2008,5,16]],"date-time":"2008-05-16T10:07:45Z","timestamp":1210932465000},"page":"103-121","source":"Crossref","is-referenced-by-count":17,"title":["Quadratic 0\u20131 programming: Tightening linear or quadratic convex reformulation by use of relaxations"],"prefix":"10.1051","volume":"42","author":[{"given":"Alain","family":"Billionnet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sourour","family":"Elloumi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marie-Christine","family":"Plateau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"W.P. Adams, R. Forrester and F. Glover, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs.\n                      Discrete Optim.\n                      1(2)\n                      (2004) 99\u2013120.","DOI":"10.1016\/j.disopt.2004.03.006"},{"key":"R2","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"Adams","year":"1986","journal-title":"Manage. Sci."},{"key":"R3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"Adams","year":"1993","journal-title":"Math. Program."},{"key":"R4","unstructured":"J.E. Beasley, Heuristic algorithms for the unconstrained binary quadratic programming problem.\n                      Technical report, Department of Mathematics, Imperial College of Science and Technology, London, England\n                      (1998)."},{"key":"R5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"Billionnet","year":"2007","journal-title":"Math. Program."},{"key":"R6","unstructured":"A. Billionnet, S. Elloumi and M.C. Plateau, Improving the performance of standard solvers for quadratic 0-1 programs by a toight convex reformulation: the QCR method.\n                      Discrete Appl. Math.\n                      , http:\/\/dx.doi.org\/10.1016\/j.dam.2007.007 (to appear)."},{"key":"R7","unstructured":"A. Billionnet, S. Elloumi and M.C. Plateau, Quadratic convex reformulation: a computational study of the graph bisection problem.\n                      Technical Report CEDRIC\n                      , http:\/\/cedric.cnam.fr\/PUBLIS\/RC1003.pdf (2005)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/ijoc.1030.0029","volume":"16","author":"Billionnet","year":"2004","journal-title":"INFORMS J. Comput."},{"key":"R9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"Carter","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"R10","unstructured":"S. Elloumi, Linear programming versus convex quadratic programming for the module allocation problem.\n                      Technical Report CEDRIC 1100\n                      , http:\/\/cedric.cnam.fr\/PUBLIS\/RC1100.pdf (2005)."},{"key":"R11","first-page":"5","volume":"4","author":"Fortet","year":"1959","journal-title":"Rev. Fr. d'Automatique d'Informatique et de Recherche Op\u00e9rationnelle"},{"key":"R12","first-page":"17","volume":"4","author":"Fortet","year":"1960","journal-title":"Cahiers du Centre d'Etudes de Recherche Op\u00e9rationnelle"},{"key":"R13","unstructured":"M. Garey and D. Johnson, Computers and intractibility: a guide to the theroy of np-completeness.\n                      W.H. freeman & Co.\n                      (1979)."},{"key":"R14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"Glover","year":"1975","journal-title":"Manage. Sci."},{"key":"R15","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","volume":"44","author":"Glover","year":"1998","journal-title":"Manage. Sci."},{"key":"R16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-005-3973-5","volume":"140","author":"Gueye","year":"2005","journal-title":"Ann. Oper. Res."},{"key":"R17","first-page":"67","volume":"3","author":"Hammer","year":"1970","journal-title":"RAIRO"},{"key":"R18","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"Hammer","year":"1984","journal-title":"Math. Program."},{"key":"R19","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"key":"R20","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"Kernighan","year":"1970","journal-title":"The Bell System Technical Journal"},{"key":"R21","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"Lodi","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"R22","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"Lov\u00e1sz","year":"1991","journal-title":"SIAM J. Optim."},{"key":"R23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"Merz","year":"2002","journal-title":"J. Heuristics"},{"key":"R24","unstructured":"M.C. Plateau, A. Billionnet and S. Elloumi, Eigenvalue methods for linearly constrained quadratic 0-1 problems with application to the densest k-subgraph problem.\n                      In 6e congr\u00e8s ROADEF, Tours, 14\u201316 f\u00e9vrier, Presses Universitaires Francois Rabelais\n                      , http:\/\/cedric.cnam.fr\/PUBLIS\/RC723.pdf (2005) 55\u201366."},{"key":"R25","doi-asserted-by":"crossref","unstructured":"H.D. Sherali and W.P. Adams,\n                      A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems\n                      . Kluwer Academic Publ., Norwell, MA (1999).","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"R26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"Sherali","year":"1995","journal-title":"J. Glob. Optim."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008011\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T08:28:32Z","timestamp":1557563312000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":26,"journal-issue":{"issue":"2"},"alternative-id":["ro0784"],"URL":"https:\/\/doi.org\/10.1051\/ro:2008011","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}