{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:48:40Z","timestamp":1781552920518,"version":"3.54.5"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,12]]},"DOI":"10.1016\/s0377-2217(98)00359-2","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"662-670","source":"Crossref","is-referenced-by-count":68,"title":["An evolutionary heuristic for quadratic 0\u20131 programming"],"prefix":"10.1016","volume":"119","author":[{"given":"Andrea","family":"Lodi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim","family":"Allemand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas M.","family":"Liebling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00359-2_BIB1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","article-title":"0\u20131 Quadratic programming approach for the optimal solution of two scheduling problems","volume":"25","author":"Alidaee","year":"1994","journal-title":"International Journal of System Science"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","article-title":"A solvable case of quadratic 0\u20131 programming","volume":"13","author":"Barahona","year":"1986","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","article-title":"Experiments in quadratic 0\u20131 programming","volume":"44","author":"Barahona","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","article-title":"On the cut polytope","volume":"36","author":"Barahona","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB5","doi-asserted-by":"crossref","unstructured":"P. Carraresi, F. Farinaccio, F. Malucelli, Testing optimality for quadratic 0\u20131 problems, Mathematical Programming, forthcoming","DOI":"10.1007\/s101070050064"},{"issue":"4","key":"10.1016\/S0377-2217(98)00359-2_BIB6","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","article-title":"A decomposition method for quadratic zero\u2013one programming","volume":"41","author":"Chardaire","year":"1995","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","article-title":"The cut polytope and the Boolean quadratic polytope","volume":"79","author":"De Simone","year":"1990","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB8","first-page":"132","article-title":"Quadratic knapsack problems","volume":"12","author":"Gallo","year":"1980","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB9","unstructured":"F. Glover, A template for scatter search and path relinking, in: J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D. Snyers (Eds.), Artificial Evolution, Lecture Notes in Computer Science, vol. 1363, 1997, pp. 13\u201354"},{"issue":"3","key":"10.1016\/S0377-2217(98)00359-2_BIB10","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","article-title":"Adaptive memory tabu search for binary quadratic programs","volume":"44","author":"Glover","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB11","unstructured":"F. Glover, G.A. Kochenberger, B. Alidaee, M. Amini, Tabu search with critical event memory: an enhanced application for Binary Quadratic Programs, in: S. Voss, S. Martello, H. Osman, C. Roucairol (Eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Boston, MA, 1998, pp. 93\u2013109"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB12","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/opre.13.3.388","article-title":"Some network flow problems solved with pseudo-Boolean programming","volume":"13","author":"Hammer","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","article-title":"Roof duality, complementation and persistence in quadratic 0\u20131 programming","volume":"28","author":"Hammer","year":"1984","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB14","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","article-title":"An implicit enumeration algorithm for quadratic integer programming","volume":"26\/3","author":"McBride","year":"1980","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB15","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein, Genetic algorithms, in: E. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, Chichester, UK, 1997, pp. 137\u2013191","DOI":"10.2307\/j.ctv346t9c.11"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","article-title":"The boolean quadratic polytope: Characteristics, facets and relatives","volume":"45","author":"Padberg","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","article-title":"Computational aspects of a branch and bound algorithm for quadratic zero\u2013one programming","volume":"45","author":"Pardalos","year":"1990","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230050405","article-title":"Minimum cuts and related problems","volume":"5","author":"Picard","year":"1974","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00359-2_BIB19","unstructured":"E. Taillard, Heuristic methods for large centroid clustering problems, Technical Paper IDSIA-96-96, IDSIA, Lugano, Switzerland, 1996"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003592?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003592?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T05:31:22Z","timestamp":1578461482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798003592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["S0377221798003592"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00359-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}