{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:48:49Z","timestamp":1771480129240,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":4064,"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":[[2002,6]]},"DOI":"10.1016\/s0166-218x(01)00263-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:32:09Z","timestamp":1027596729000},"page":"3-36","source":"Crossref","is-referenced-by-count":52,"title":["Tabu search and finite convergence"],"prefix":"10.1016","volume":"119","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sa\u0131\u0308d","family":"Hanafi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00263-3_BIB1","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0166-218X(01)00263-3_BIB2","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search, Part 2","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0166-218X(01)00263-3_BIB3","unstructured":"S. Hanafi, On the convergence of tabu search, Working paper, University of Valenciennes, France, 1998, J. Heuristics, to appear."},{"key":"10.1016\/S0166-218X(01)00263-3_BIB4","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":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00263-3_BIB5","unstructured":"S. Hanafi, A. Fr\u00e9ville, Extension of reverse elimination method through a dynamic management of the tabu list, R.A.I.R.O., to appear."},{"key":"10.1016\/S0166-218X(01)00263-3_BIB6","doi-asserted-by":"crossref","unstructured":"D. Avis, K. Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Proceedings of the Seventh ACM Symposium on Computational Geometry, North Conway, New Hampshire, 1991a, pp. 98\u2013104.","DOI":"10.1145\/109648.109659"},{"key":"10.1016\/S0166-218X(01)00263-3_BIB7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0893-9659(91)90141-H","article-title":"A basis enumeration algorithm for linear systems with geometric applications","volume":"5","author":"Avis","year":"1991","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0166-218X(01)00263-3_BIB8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","article-title":"Reverse search for enumeration","volume":"6","author":"Avis","year":"1996","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/S0166-218X(01)00263-3_BIB9","first-page":"187","article-title":"Le probl\u00e8me des labyrinthes","volume":"14","author":"Tarry","year":"1895","journal-title":"Nouv. Ann. Math."},{"key":"10.1016\/S0166-218X(01)00263-3_BIB10","unstructured":"G.L. Thompson, The Tarry Traverse, Class notes, Carnegie-Mellon University, Graduate School of Industrial Administration, 1998."},{"key":"10.1016\/S0166-218X(01)00263-3_BIB11","unstructured":"A. Charnes, W.W. Cooper, Mathematical Models and Industrial Applications of Linear Programming, Vol. I, Wiley, New York and London, 1961, pp. 438\u2013444."},{"key":"10.1016\/S0166-218X(01)00263-3_BIB12","unstructured":"F. Glover, S. Hanafi, Composite tree searches for global optimization, Research Report, Graduate School of Business and Administration, University of Colorado, Boulder, 1998."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002633?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002633?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:27:57Z","timestamp":1556735277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0166218X01002633"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00263-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}