{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:55:04Z","timestamp":1777694104050,"version":"3.51.4"},"reference-count":17,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1051\/ro:2004008","type":"journal-article","created":{"date-parts":[[2004,3,31]],"date-time":"2004-03-31T14:04:13Z","timestamp":1080741853000},"page":"249-271","source":"Crossref","is-referenced-by-count":1,"title":["Construction de facettes pour le polytope du sac-\u00e0-dos quadratique en 0-1"],"prefix":"10.1051","volume":"37","author":[{"given":"Alain","family":"Faye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Boyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2004,3,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"W.P. Adams et H.D. Sherali, A tight linearization and an algorithm for zero-one quadratic programming problem.Manage. Sci.32(1986) 1274-1289 .","DOI":"10.1287\/mnsc.32.10.1274"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"A. Billionnet et F. Calmels, Linear programming for the 0-1 quadratic knapsack problem.Eur. J. Oper. Res.92(1996) 310-325 .","DOI":"10.1016\/0377-2217(94)00229-0"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"A. Billionnet, A. Faye et E. Soutif, A new upper bound for the 0-1 quadratic knapsack problem.Eur. J. Oper. Res.112(1999) 664-672 .","DOI":"10.1016\/S0377-2217(97)00414-1"},{"key":"R4","first-page":"226","volume":"1403","author":"Chaillou","year":"1986","journal-title":"Lect. Notes Math."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"S. Elloumi, A. Faye et E. Soutif, Decomposition and linearization for 0-1 quadratic programming.Ann. Oper. Res.99(2000) 79-93.","DOI":"10.1023\/A:1019236832495"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"L.F. Escudero, A. Garin et G. P\u00e9rez, An O(nlogn) procedure for identifying facets of the knapsack polytope.Oper. Res. Lett.31(2003) 211-218 .","DOI":"10.1016\/S0167-6377(02)00221-3"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"C. Helmberg, F. Rendl et R. Weismantel, A semidefinite programming approach to the quadratic knapsack problem.J. Comb. Optim.4(2000) 197-215 .","DOI":"10.1023\/A:1009898604624"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"E.J. Johnson, A. Mehrotra et G.L. Nemhauser, Min-cut clustering.Math. Program.62(1993) 133-152 .","DOI":"10.1007\/BF01585164"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"A. Mehrotra, Cardinality constrained Boolean quadratic polytope.Discrete Appl. Math.79(1997) 137-154 .","DOI":"10.1016\/S0166-218X(97)00039-5"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"P. Michelon et L. Veilleux, Lagrangean methods for the 0-1 quadratic knapsack problem.Eur. J. Oper. Res.92(1996) 326-341 .","DOI":"10.1016\/0377-2217(94)00286-X"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"G.L Nemhauser et L.A. Wolsey, Integer and Combinatorial Optimization.Wiley Intersci. Ser. Discrete Math. Optim.(1988).","DOI":"10.1002\/9781118627372"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"M. Padberg, The boolean quadric polytope: some characteristics, facets and relatives.Math. Program.45(1989) 139-172 .","DOI":"10.1007\/BF01589101"},{"key":"R13","unstructured":"D.J. Rader,Valid inequalities and facets of the quadratic 0-1 knapsack polytope. Rutcor Research Report 16-97 (1997) 11 p."},{"key":"R14","unstructured":"D.J. Rader,Lifting results for the quadratic 0-1 knapsack polytope. Rutcor Research Report 17-97 (1997) 27 p."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"M.G.C. Resende, K.G. Ramakrishnan et Z. Drezner, Computing Lower Bounds for the Quadratic assignment problem with an interior point algorithm for linear programming.Oper. Res.43(1995) 781-791 .","DOI":"10.1287\/opre.43.5.781"},{"key":"R16","unstructured":"E. Soutif,R\u00e9solution du probl\u00e8me de sac-\u00e0-dos quadratique en variables bivalentes. Th\u00e8se de doctorat du CNAM Paris (2000)."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"E. Zemel, Lifting the facets of zero-one polytopes.Math. Program.15(1978) 268-277 .","DOI":"10.1007\/BF01609032"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2004008\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T12:59:05Z","timestamp":1524747545000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2004008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":17,"journal-issue":{"issue":"4"},"alternative-id":["ro04ns"],"URL":"https:\/\/doi.org\/10.1051\/ro:2004008","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}