{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:57:47Z","timestamp":1761487067705},"reference-count":32,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1051\/ro:2001123","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T08:44:25Z","timestamp":1069231465000},"page":"415-438","source":"Crossref","is-referenced-by-count":15,"title":["Une approche hybride pour le sac \u00e0 dos multidimensionnel en variables 0\u20131"],"prefix":"10.1051","volume":"35","author":[{"given":"Michel","family":"Vasquez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.6.1.82","volume":"6","author":"Aboudi","year":"1994","journal-title":"ORSA J. Comput."},{"key":"R2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"Balas","year":"1980","journal-title":"Management Sci."},{"key":"R3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"Battiti","year":"1994","journal-title":"ORSA J. Comput."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"R. Bellman et D. Stuart,Applied Dynamic Programming. Princeton University Press (1962).","DOI":"10.1515\/9781400874651"},{"key":"R5","unstructured":"P. Boucher et G. Plateau, \u00c9tude des m\u00e9thodes de bruitage appliqu\u00e9es au probl\u00e8me du sac \u00e0 dos \u00e0 plusieurs contraintes en variables 0-1, dansJNPCC'99 5esjourn\u00e9es nationales sur la r\u00e9solution pratique de probl\u00e8mes NP-complets(1999) 151-162."},{"key":"R6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"Charon","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"R7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"Chu","year":"1998","journal-title":"J. Heuristic"},{"key":"R8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02022561","volume":"41","author":"Dammeyer","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"Dantzig","year":"1957","journal-title":"Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"Drexl","year":"1988","journal-title":"Computing"},{"key":"R11","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/0377-2217(86)90042-1","volume":"24","author":"Fr\u00e9ville","year":"1986","journal-title":"Eur. J. Oper. Res."},{"key":"R12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1051\/ro\/1993270201691","volume":"27","author":"Fr\u00e9ville","year":"1993","journal-title":"RAIRO: Oper. Res."},{"key":"R13","first-page":"147","volume":"2","author":"Fr\u00e9ville","year":"1997","journal-title":"J. Heuristics"},{"key":"R14","unstructured":"X. Gandibleux et A. Fr\u00e9ville, The multiobjective tabu search method customized on the 0\/1 multiobjective knapsack problem: The two objectives case.J. Heuristics(\u00e0 para\u00eetre)."},{"key":"R15","unstructured":"M. Garey et D. Johnson,Computers & Intractability A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)."},{"key":"R16","first-page":"215","volume":"31","author":"Gavish","year":"1982","journal-title":"Management of Distributed Data Processing"},{"key":"R17","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"Gavish","year":"1985","journal-title":"Math. Programming"},{"key":"R18","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","volume":"14","author":"Gilmore","year":"1966","journal-title":"Oper. Res."},{"key":"R19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Computing"},{"key":"R20","unstructured":"F. Glover et G.A. Kochenberger, Critical event tabu search for multidimensional knapsack problems, edit\u00e9 par I.H. Osman et J.P. Kelly,Metaheuristics: The Theory and Applications. Kluwer Academic Publishers (1996) 407-427."},{"key":"R21","unstructured":"M. Gondran et M. Minoux,Graphes & algorithmes. Eyrolles (1985)."},{"key":"R22","unstructured":"S. Hanafi, A. El Abdellaoui et A. Fr\u00e9ville, Extension de la M\u00e9thode d'\u00c9limination Inverse pour une gestion dynamique de la liste tabou.RAIRO(\u00e0 para\u00eetre)."},{"key":"R23","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/S0377-2217(97)00296-8","volume":"106","author":"Hanafi","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"R24","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1287\/mnsc.34.3.402","volume":"34","author":"Lee","year":"1998","journal-title":"Management Sci."},{"key":"R25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1086\/294081","volume":"28","author":"Lorie","year":"1955","journal-title":"J. Business"},{"key":"R26","doi-asserted-by":"crossref","unstructured":"A. Lo\/kketangen et F. Glover, Solving z\u00e9ro-one mixed integer programming problems using tabu search.Eur. J. Oper. Res.106(1998). Special Issue on Tabu Search.","DOI":"10.1016\/S0377-2217(97)00295-6"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"A. Lo\/kketangen et F. Glover, Candidate list and exploration strategies for solving 0\/1 mip problems using a pivot neighborhood, dansMetaheuristics. Kluwer Academic Publishers (1999).","DOI":"10.1007\/978-1-4615-5775-3_10"},{"key":"R28","unstructured":"S. Martello et P. Toth,Knapsack Problems: Algorithms and Computer Implementations. John Wiley (1990)."},{"key":"R29","unstructured":"M.A. Osorio, F. Glover et P. Hammer,Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions, Technical report. Hearin Center for Enterprise Science. Report HCES-08-00 (2000)."},{"key":"R30","unstructured":"W.H. Press, S.A. Teukolsky, W.T. Vetterling et B.P. Flannery,Numerical Recipes in C. Cambridge University Press (1992)."},{"key":"R31","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"Shih","year":"1979","journal-title":"J. Oper. Res. Soc."},{"key":"R32","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1287\/mnsc.21.12.1417","volume":"21","author":"Toyoda","year":"1975","journal-title":"Management Sci."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001123\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T02:49:32Z","timestamp":1585277372000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":32,"journal-issue":{"issue":"4"},"alternative-id":["ro20110"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001123","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}