{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T16:49:29Z","timestamp":1773766169679,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":[[2002,3]]},"DOI":"10.1016\/s0377-2217(01)00209-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:08:03Z","timestamp":1027577283000},"page":"272-287","source":"Crossref","is-referenced-by-count":50,"title":["One-pass heuristics for large-scale unconstrained binary quadratic problems"],"prefix":"10.1016","volume":"137","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bahram","family":"Alidaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9sar","family":"Rego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary","family":"Kochenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00209-0_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 Systems Science"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB2","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0377-2217(97)00130-6","article-title":"Simulated annealing for the unconstrained binary quadratic pseudo-boolean function","volume":"108","author":"Alkhamis","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB3","unstructured":"M. Amini, B. Alidaee, G. Kochenberger, A scatter search approach to unconstrained quadratic binary programs, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Methods in Optimization, McGraw-Hill, New york, 1999 (to appear)"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB4","unstructured":"J.E. Beasley, Heuristic algorithms for the unconstrained binary quadratic programming problem, Working Paper, Imperial College, 1999"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB5","doi-asserted-by":"crossref","unstructured":"E. Boros, P. Hammer, X. Sun, The DDT method for quadratic 0\u20131 minimization, RUTCOR Research Center, RRR 39-89, 1989","DOI":"10.1016\/0167-6377(90)90044-6"},{"issue":"4","key":"10.1016\/S0377-2217(01)00209-0_BIB6","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","article-title":"A decomposition method for quadratic 0\u20131 programming","volume":"41","author":"Chartaire","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB7","first-page":"132","article-title":"Quadratic knapsack problems","volume":"12","author":"Gallo","year":"1980","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB8","unstructured":"F. Glover, M. Amini, G. Kochenberger, B. Alidaee, A new evolutionary metaheuristic for the unconstrained binary quadratic programming: A case study of the scatter search, School of Business, University of Colorado, Boulder, September 1999"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB9","series-title":"Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization","article-title":"Tabu with search critical event memory: An enhanced application for binary quadratic programs","author":"Glover","year":"1999"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB10","unstructured":"F. Glover, G. Kochenberger, B. Alidaee, M. Amini, Unconstrained quadratic binary program approach to quadratic Knapsack problems, Working paper, Hearin Center for Enterprise Science, University of Mississippi, 1999"},{"issue":"3","key":"10.1016\/S0377-2217(01)00209-0_BIB11","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(01)00209-0_BIB12","unstructured":"P. Hammer, E. Boros, X. Sun, On quadratic unconstrained binary optimization, INFORMS National Meeting, Seattle, October, 1998"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB13","series-title":"Boolean Methods in Operations Research","author":"Hammer","year":"1968"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","article-title":"On the notion of balanced of a signed graph","volume":"2","author":"Harary","year":"1953","journal-title":"Michigan Mathematical Journal"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB15","unstructured":"K. Katayama, M. Tani, H. Narihisa, Solving large binary quadratic programming problems by an effective genetic local search algorithm, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'00), Morgan Kaufmann, 2000 (to appear)"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB16","unstructured":"G. Kochenberger, B. Alidaee, M. Amini, Applications of the unconstrained quadratic binary program, Working Paper, University of Colorado, 1998"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","article-title":"Computer aided layout design","volume":"9","author":"Krarup","year":"1978","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB18","first-page":"454","article-title":"Quadratic binary programming","volume":"14","author":"Laughunn","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB19","unstructured":"A. Lodi, K. Allemand, T.M. Liebling, An evolutionary heuristic for quadratic 0\u20131 programming, Technical Report OR-97-12, D.E.I.S., University of Bologna, 1997"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB20","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","author":"McBride","year":"1980","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB21","unstructured":"P. Merz, B. Freisleben, Genetic algorithms for binary quadratic programming, in: Proceedings of the 1999 International Genetic and Evolutionary Computation Conferecne (GECCO'99), Morgan Kaufmann, Los Altos, CA, 1999, pp. 417\u2013424"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","article-title":"Computational aspects of a branch and bound algorithm for quadratic 0\u20131 programming","volume":"45","author":"Pardalos","year":"1990","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB23","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","article-title":"A branch and bound algorithm for maximum clique problem","volume":"19","author":"Pardalos","year":"1992","journal-title":"Computer & OR"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","article-title":"The maximum clique problem","volume":"4","author":"Pardalos","year":"1994","journal-title":"The Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01096724","article-title":"A quadratic assignment formulation of the molecular conformation problem","volume":"4","author":"Phillips","year":"1994","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB26","unstructured":"A.C. Willaims, Quadratic 0\u20131 programming using the roof duality with computational results, Rutcor Research Report 8-85, Rutgers University, New Brunswick, NJ, 1985"},{"key":"10.1016\/S0377-2217(01)00209-0_BIB27","doi-asserted-by":"crossref","unstructured":"C. Witsgall, Mathematical methods of site selection for electronic system (EMS), NBS Internal Report, 1975","DOI":"10.6028\/NBS.IR.75-737"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002090?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:50:14Z","timestamp":1578430214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0377221701002090"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00209-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}