{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:22:23Z","timestamp":1775326943459,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1023\/a:1026565712483","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T17:11:16Z","timestamp":1068138676000},"page":"47-58","source":"Crossref","is-referenced-by-count":37,"title":["On the Convergence of Tabu Search"],"prefix":"10.1007","volume":"7","author":[{"given":"Sa\u00efd","family":"Hanafi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"277430_CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.6.1.82","volume":"6","author":"R. Aboudi","year":"1994","unstructured":"Aboudi, R. and K. J\u00f6rnsten. (1994). \u201cTabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic.\u201d ORSA Journal of Computing 6, 82\u201393.","journal-title":"ORSA Journal of Computing"},{"key":"277430_CR2","first-page":"86","volume":"26","author":"E. Balas","year":"1980","unstructured":"Balas, E. and C.H. Martin. (1980). \u201cPivot and Complement\u2014A Heuristic for 0-1 Programming.\u201d Management Science Research 26, 86\u201396.","journal-title":"Management Science Research"},{"key":"277430_CR3","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/ijoc.3.3.262","volume":"3","author":"F. Dammeyer","year":"1991","unstructured":"Dammeyer, F., P. Forst, and S. Vo\u00df. (1991). \u201cOn the Cancellation Sequence Method of Tabu Search.\u201d ORSA Journal on Computing 3, 262\u2013265.","journal-title":"ORSA Journal on Computing"},{"key":"277430_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02022561","volume":"41","author":"F. Dammeyer","year":"1993","unstructured":"Dammeyer, F. and S. Vo\u00df. (1993). \u201cDynamic Tabu List Management using the Reverse Elimination Method.\u201d Annals of Operations Research 41, 31\u201346.","journal-title":"Annals of Operations Research"},{"key":"277430_CR5","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo, T.A., M.G.C. Resende, and S.H. Smith. (1994). \u201cA Greedy Randomized Adaptive Search for Maximum Independent Set.\u201d Operations Research 42, 860.","journal-title":"Operations Research"},{"key":"277430_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Fransisco: W.H. Freeman and Company."},{"key":"277430_CR7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search, Part 1.\u201d ORSA Journal on Computing 1, 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"key":"277430_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search, Part 2.\u201d ORSA Journal on Computing 2, 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"277430_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Dordrecht: Kluwer Academic Publishers."},{"key":"277430_CR10","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley."},{"key":"277430_CR11","unstructured":"Hanafi, S., and A. Fr\u00e9ville. (1996). \u201cAn Efficient Tabu Search Approach for the 0-1 Multidimensional Knapsack Problem.\u201d In Fred Glover (ed.), Special Issue on Tabu Search, to appear in European Journal of Operational Research."},{"key":"277430_CR12","first-page":"449","volume-title":"Metaheuristics: Theory and Applications","author":"S. Hanafi","year":"1995","unstructured":"Hanafi, S., A. Fr\u00e9ville, and A. El Abdellaoui. (1995). \u201cComparison of Heuristics for the 0-1 Multidimensional Kanapsack Problem.\u201d In I.H. Osman and J.P. Kelly (eds.), Metaheuristics: Theory and Applications. Dordrecht: Kluwer, pp. 449\u2013466."},{"key":"277430_CR13","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/0305-0548(94)90017-5","volume":"13","author":"R. H\u00fcbscher","year":"1994","unstructured":"H\u00fcbscher, R. and F. Glover. (1994). \u201cApplying Tabu Search with Influential Diversification to Multiprocessor Scheduling.\u201d Computer and Operation Research 13, 877\u2013884.","journal-title":"Computer and Operation Research"},{"key":"277430_CR14","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., C.D. Gelatt, and M.P. Vechi. (1983). \u201cOptimization by Simulated Annealing.\u201d Science 220, 671\u2013680.","journal-title":"Science"},{"key":"277430_CR15","first-page":"443","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S. and B.W. Kernighan. (1973). \u201cAn Effective Heuristic Algorithm for the Traveling Salesman Problem.\u201d Operations Research 21, 443\u2013452.","journal-title":"Operations Research"},{"key":"277430_CR16","volume-title":"Solving Zero-One Mixed Integer Programming Problems Using Tabu Search","author":"A. Lokketangen","year":"1996","unstructured":"Lokketangen, A. and F. Glover. (1996). \u201cSolving Zero-One Mixed Integer Programming Problems Using Tabu Search.\u201d Working paper, University of Colorado, USA."},{"key":"277430_CR17","unstructured":"Mladenovic, N. and P. Hansen. (1996). \u201cVariable Neighborhood Search.\u201d Les Cahiers du GERAD, G-96-49."},{"key":"277430_CR18","first-page":"513","volume":"63","author":"I.H. Osman","year":"1996","unstructured":"Osman, I.H. and G. Laporte. (1996). \u201cMeta-Heuristics: A Biography.\u201d Annals Opnl. Res. 63, 513\u2013628.","journal-title":"Annals Opnl. Res."},{"key":"277430_CR19","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C. Reeves","year":"1993","unstructured":"Reeves, C. (1993). Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026565712483.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026565712483\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026565712483.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:52:59Z","timestamp":1747651979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026565712483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["277430"],"URL":"https:\/\/doi.org\/10.1023\/a:1026565712483","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}