{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:46:47Z","timestamp":1771145207325,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00295-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"624-658","source":"Crossref","is-referenced-by-count":74,"title":["Solving zero-one mixed integer programming problems using tabu search"],"prefix":"10.1016","volume":"106","author":[{"given":"Arne","family":"Lokketangen","sequence":"first","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0377-2217(97)00295-6_BIB1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.6.1.82","article-title":"Tabu search for general zero-one integer programs using the pivot and complement heuristic","volume":"6","author":"Aboudi","year":"1994","journal-title":"ORSA Journal of Computing"},{"issue":"1","key":"10.1016\/S0377-2217(97)00295-6_BIB2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","article-title":"Pivot and complement \u2014 a heuristic for 0\u20131 programming","volume":"26","author":"Balas","year":"1980","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB3","doi-asserted-by":"crossref","first-page":"1206","DOI":"10.1287\/opre.16.6.1206","article-title":"an approach to zero-one integer programming","volume":"16","author":"Cabot","year":"1968","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/S0377-2217(97)00295-6_BIB4","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1992.75","article-title":"General purpose simulated annealing","volume":"43","author":"Connolly","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02022561","article-title":"Dynamic tabu list management using the reverse elimination method","volume":"41","author":"Dammeyer","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB6","series-title":"Modern Heuristics for Combinatorial Problems","article-title":"Simulated annealing","author":"Dowsland","year":"1993"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","article-title":"A simulated annealing approach to the multiconstraint zero-one knapsack problem","volume":"40","author":"Drexl","year":"1988","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB8","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1287\/opre.16.6.1212","article-title":"A note on linear programming and integer infeasibility","volume":"16","author":"Glover","year":"1968","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(97)00295-6_BIB9","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","article-title":"Heuristics for integer programming using surrogate constraints","volume":"8","author":"Glover","year":"1977","journal-title":"Decision Sciences"},{"issue":"3","key":"10.1016\/S0377-2217(97)00295-6_BIB10","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2014 Part 1","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"issue":"4","key":"10.1016\/S0377-2217(97)00295-6_BIB11","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","article-title":"Tabu thresholding: Improved search by nonmonotonic trajectories","volume":"7","author":"Glover","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB12","series-title":"Tabu Search Fundamentals and Uses","author":"Glover","year":"1994"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB13","series-title":"Interfaces in Computer Science and Operations Research","first-page":"1","article-title":"Tabu search and adaptive memory programming \u2014 advances, applications and challenges","author":"Glover","year":"1996"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(89)90185-9","article-title":"New approaches for heuristic search: A bilateral linkage with artificial intelligence","volume":"39","author":"Glover","year":"1989","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB15","series-title":"Modern Heuristics for Combinatorial Problems","article-title":"Tabu search","author":"Glover","year":"1993"},{"issue":"5","key":"10.1016\/S0377-2217(97)00295-6_BIB16","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0305-0548(86)90050-X","article-title":"The general employee scheduling problem: An integration of MS and Al","volume":"13","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02078647","article-title":"A users guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(97)00295-6_BIB18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","article-title":"Semi-greedy heuristics: An empirical study","volume":"6","author":"Hart","year":"1987","journal-title":"Operations Research Letters"},{"issue":"1","key":"10.1016\/S0377-2217(97)00295-6_BIB19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","article-title":"Testing heuristics: We have it all wrong","volume":"1","author":"Hooker","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB20","article-title":"The application of heuristic methods and artificial intelligence to a class of production scheduling problems","author":"Laguna","year":"1990"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0957-4174(93)90056-C","article-title":"Integrating target analysis and tabu search for improved scheduling systems","volume":"6","author":"Laguna","year":"1993","journal-title":"Expert Systems With Applications"},{"issue":"2","key":"10.1016\/S0377-2217(97)00295-6_BIB22","first-page":"89","article-title":"Tabu search for zero\/one mixed integer programming with advanced level strategies and learning","volume":"1","author":"L\u00f8kketangen","year":"1995","journal-title":"International Journal of Operations and Quantitative Management"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB23","series-title":"Meta-Heuristics: Theory and Applications","first-page":"467","article-title":"Probabilistic move selection in tabu search for 0\/1 mixed integer programming problems","author":"L\u00f8kketangen","year":"1996"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB24","series-title":"Proceedings of the DIMACS workshop on Satisfiability Problems: Theory and Applications","article-title":"Surrogate constraint analysis \u2014 new heuristics and learning schemes for satisfiability problems","author":"L\u00f8kketangen","year":"1996"},{"issue":"3","key":"10.1016\/S0377-2217(97)00295-6_BIB25","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0969-6016(94)90031-0","article-title":"Tabu search within a pivot and complement framework","volume":"1","author":"L\u00f8kketangen","year":"1994","journal-title":"International Transactions of Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00295-6_BIB26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00247208","article-title":"Progressive hedging and tabu search applied to mixed integer (0,1) multi-stage stochastic programming","volume":"2","author":"L\u00f8kketangen","year":"1996","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB27","author":"Marsten","year":"1989"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB28","author":"Marsten","year":"1989","journal-title":"User's Manual for ZOOM\/XMP XMP Software"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB29","article-title":"Generating scenarios for the towers perrin investment systems","author":"Mulvey","year":"1995"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB30","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.13.9.736","article-title":"Computational experience with variants of the Balas algorithm applied to the selection of R and D projects","volume":"13","author":"Petersen","year":"1967","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0377-2217(97)00295-6_BIB31","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0166-218X(93)E0134-K","article-title":"The depth and width of local minima in discrete solution spaces","volume":"56","author":"Ryan","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB32","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/mnsc.15.4.B196","article-title":"An approach to linear programming with 0\u20131 variables","volume":"15","author":"Senyu","year":"1968","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB33","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1057\/jors.1979.78","article-title":"A branch and bound method for the multiconstraint zero-one knapsack problem","volume":"30","author":"Shih","year":"1979","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00295-6_BIB34","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","article-title":"Methods for the solution of multi-dimensional 0\/1 knapsack problems","volume":"15","author":"Weingartner","year":"1967","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002956?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002956?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:56:33Z","timestamp":1556384193000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":34,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002956"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00295-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}