{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:13:19Z","timestamp":1780765999162,"version":"3.54.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7078,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0166-218x(94)90211-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"231-255","source":"Crossref","is-referenced-by-count":145,"title":["Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)"],"prefix":"10.1016","volume":"49","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90211-9_BIB1","unstructured":"W.B. Crowston, F. Glover, G.L. Thompson and J.D. Trawick, Probabilistic and parametric learning combinations of local job shop scheduling rules, ONR Research Memorandum No. 117, GSIA, Carnegie-Mellon University, Pittsburg, PA."},{"key":"10.1016\/0166-218X(94)90211-9_BIB2","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1287\/opre.21.5.1114","article-title":"Optimal solution of scheduling problems using generalized Lagrangian multipliers: Part I","volume":"21","author":"Fisher","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90211-9_BIB3","first-page":"59","article-title":"Using duality to solve discrete optimization problems: Theory and computation experience","volume":"3","author":"Fisher","year":"1975","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(94)90211-9_BIB4","first-page":"78","article-title":"An efficient preprocessing procedure for the solution of 0\u20131 multiknapsack problems to optimality","volume":"31","author":"Freville","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)90211-9_BIB5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","article-title":"Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality","volume":"31","author":"Gavish","year":"1985","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)90211-9_BIB6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation and its uses in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(94)90211-9_BIB7","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1287\/opre.13.6.879","article-title":"A multiphase-dual algorithm for the zero-one integer programming problem","volume":"13","author":"Glover","year":"1965","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90211-9_BIB8","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 Sci."},{"key":"10.1016\/0166-218X(94)90211-9_BIB9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0166-218X(94)90211-9_BIB10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/mde.4090110512","article-title":"Artificial intelligence, heuristic frameworks and tabu search","volume":"11","author":"Glover","year":"1990","journal-title":"Managerial and Decision Economics"},{"key":"10.1016\/0166-218X(94)90211-9_BIB11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580728","article-title":"Layering strategies for creating exploitable structure in linear and integer programs","volume":"40","author":"Glover","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)90211-9_BIB12","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1988"},{"key":"10.1016\/0166-218X(94)90211-9_BIB13","series-title":"Computer-Assisted Analysis and Model Simplification","author":"Greenberg","year":"1980"},{"key":"10.1016\/0166-218X(94)90211-9_BIB14","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1287\/opre.18.5.924","article-title":"Surrogate mathematical programming","volume":"18","author":"Greenberg","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)90211-9_BIB15","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01531073","article-title":"The tabu search metaheuristic: how we used it","volume":"1","author":"Hertz","year":"1991","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/0166-218X(94)90211-9_BIB16","unstructured":"M. Laguna, W. Barnes and F. Glover, Scheduling jobs with linear delay penalties and sequence dependent costs and times, Department of Mechanical Engineering, University of Texas, Austin, TX; also: Appl. Intelligence, to appear."},{"key":"10.1016\/0166-218X(94)90211-9_BIB17","unstructured":"G.E. Liepens and M.D. Vose, Representational issues in genetic algorithms, Res. Rep., Oak Ridge National Laboratories."},{"key":"10.1016\/0166-218X(94)90211-9_BIB18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1287\/ijoc.3.4.307","article-title":"A non-standard genetic algorithm for the nonlinear transportation problem","volume":"3","author":"Michalewicz","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/0166-218X(94)90211-9_BIB19","doi-asserted-by":"crossref","unstructured":"H. Muhlenbein, Parallel genetic algorithms and combinatorial optimization, SIAM J. Optim., to appear.","DOI":"10.1016\/B978-0-08-040806-4.50034-4"},{"key":"10.1016\/0166-218X(94)90211-9_BIB20","series-title":"Proceedings 3rd International Conference of Genetic Algorithms, Fairfax, VA","first-page":"133","article-title":"Scheduling problems and traveling salesmen: the genetic edge recombination operator","author":"Whitley","year":"1989"},{"key":"10.1016\/0166-218X(94)90211-9_BIB21","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1287\/mnsc.31.10.1312","article-title":"An improved successive linear programming algorithm","volume":"31","author":"Zhang","year":"1985","journal-title":"Management Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94902119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94902119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:51:28Z","timestamp":1555131088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94902119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0166218X94902119"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90211-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}