{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:57:06Z","timestamp":1761893826126,"version":"3.40.5"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"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":["Annals of Operations Research"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1023\/a:1021573507189","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T01:44:11Z","timestamp":1048211051000},"page":"165-174","source":"Crossref","is-referenced-by-count":9,"title":["Tabu Search with Simple Ejection Chains for Coloring Graphs"],"prefix":"10.1007","volume":"117","author":[{"given":"Jos\u00e9 Luis","family":"Gonz\u00e1lez-Velarde","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5101705_CR1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M. Chams","year":"1987","unstructured":"M. Chams, A. Hertz and D. deWerra, Some experiments with simulated annealing for coloring graphs, European Journal of Operational Research 32 (1987) 260\u2013266.","journal-title":"European Journal of Operational Research"},{"key":"5101705_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/ijoc.6.2.141","volume":"6","author":"U. Dorndorf","year":"1994","unstructured":"U. Dorndorf and E. Pesch, Fast clustering algorithms, ORSA Journal on Computing 6 (1994) 141\u2013153.","journal-title":"ORSA Journal on Computing"},{"key":"5101705_CR3","first-page":"33","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"R. Dorne","year":"1999","unstructured":"R. Dorne and J.-K. Hao, Tabu Search for graph coloring, T-coloring and set T-colorings, in: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, eds. S. Vo\u00df, S. Martello, I. Osman and C. Roucairol (Kluwer, Boston, 1999) pp. 33\u201347."},{"key":"5101705_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A.R.E. Feo","year":"1989","unstructured":"T.A.R.E. Feo and M.G.C. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Operations Research Letters 8 (1989) 67\u201371.","journal-title":"Operations Research Letters"},{"key":"5101705_CR5","first-page":"1","volume":"2","author":"T.A.R.E. Feo","year":"1995","unstructured":"T.A.R.E. Feo and M.G.C. Resende, Greedy randomized adaptive search procedures, Journal of Global Optimization 2 (1995) 1\u201327.","journal-title":"Journal of Global Optimization"},{"key":"5101705_CR6","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"C. Fleurent and J.A. Ferland, Genetic and hybrid algorithms for graph coloring, Annals of Operation Research 63 (1996) 437\u2013464.","journal-title":"Annals of Operation Research"},{"key":"5101705_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman, San Francisco, CA, 1979)."},{"key":"5101705_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"F. Glover and M. Laguna, Tabu Search (Kluwer Academic, Dordrecht, 1997)."},{"key":"5101705_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1988","unstructured":"A. Hertz and D. de Werra, Using Tabu Search techniques for graph coloring, Computing 39 (1988) 345\u2013351.","journal-title":"Computing"},{"key":"5101705_CR10","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"J.H. Holland, Adaptation in Natural and Artificial Systems (Michigan University Press, Ann Arbor, MI, 1975)."},{"key":"5101705_CR11","first-page":"513","volume-title":"Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson, Worst-case behavior of graph coloring algorithms, in: Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica Publishing, Winnipeg, Canada (1974) pp. 513\u2013528."},{"key":"5101705_CR12","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"31","author":"D.S. Johnson","year":"1991","unstructured":"D.S. Johnson, C.A. Aragon, L.A. Mcgeoch and C. Schevon, Optimization by simulated annealing: an experimental evaluation - part II (graph coloring and number partitioning), Operations Research 31 (1991) 378\u2013406.","journal-title":"Operations Research"},{"key":"5101705_CR13","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671\u2013680.","journal-title":"Science"},{"key":"5101705_CR14","first-page":"677","volume":"42","author":"M. Laguna","year":"1995","unstructured":"M. Laguna, J.P. Kelly, J.L. Gonz\u00e1lez-Velarde and F. Glover, Tabu search for the multilevel generalized assignment problem, European Journal of Operational Research 42 (1995) 677\u2013687.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5101705_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1011237503342","volume":"19","author":"M. Laguna","year":"2001","unstructured":"M. Laguna and R. Mart\u00ed A GRASP for coloring sparse graphs, Computational Optimization and Applications 19(2) (2001) 165\u2013178.","journal-title":"Computational Optimization and Applications"},{"key":"5101705_CR16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F.T. Leighton","year":"1979","unstructured":"F.T. Leighton, A graph coloring algorithm for large scheduling problems, J. Res. Nat. Bur. Standards 84 (1979) 489\u2013506.","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"5101705_CR17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E. Pesch","year":"1997","unstructured":"E. Pesch and F. Glover, TSP ejection chains, Discrete Applied Mathematics 76 (1997) 165\u2013181.","journal-title":"Discrete Applied Mathematics"},{"key":"5101705_CR18","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/978-1-4613-1361-8_40","volume-title":"Meta-Heuristics: Theory and Applications","author":"C. Rego","year":"1996","unstructured":"C. Rego and C. Roucairol, A parallel tabu search algorithm using ejection chains for the vehicle routing problem, in: Meta-Heuristics: Theory and Applications, eds. I.H. Osman and J.P. Kelly (Kluwer Academic, Dordrecht, 1996) pp. 661\u2013675."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021573507189.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021573507189\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021573507189.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:24:22Z","timestamp":1747578262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021573507189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":18,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["5101705"],"URL":"https:\/\/doi.org\/10.1023\/a:1021573507189","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}