{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:23:48Z","timestamp":1770499428368,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":[[2003,12]]},"DOI":"10.1016\/s0377-2217(02)00832-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"379-388","source":"Crossref","is-referenced-by-count":120,"title":["A variable neighborhood search for graph coloring"],"prefix":"10.1016","volume":"151","author":[{"given":"C\u00e9dric","family":"Avanthay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00832-9_BIB1","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptative multi-start technique for combinatorial global optimizations","volume":"16","author":"Boese","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color vertices of a graph","volume":"22","author":"Br\u00e9laz","year":"1979","journal-title":"Communications of ACM"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB4","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/mnsc.19.4.456","article-title":"Chromatic scheduling and the chromatic number problem","volume":"19","author":"Brown","year":"1972","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB5","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","article-title":"Some experiments with simulated annealing for coloring graphs","volume":"32","author":"Chams","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02430368","article-title":"Embedding of a sequential algorithm within an evolutionary algorithm for coloring problems in graphs","volume":"1","author":"Costa","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB7","doi-asserted-by":"crossref","unstructured":"J.C. Culberson, Exploring the k-colorable landscape with Iterated Greedy, in [21], 1996, pp. 245\u2013284","DOI":"10.1090\/dimacs\/026\/13"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","article-title":"Greedy randomized adaptative search","volume":"6","author":"Feo","year":"1995","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB9","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","article-title":"Genetic and hybrid algorithms for graph coloring","volume":"63","author":"Fleurent","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB10","doi-asserted-by":"crossref","unstructured":"C. Fleurent, J.A. Ferland, Objected-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability, in [21], 1996, pp. 619\u2013652","DOI":"10.1090\/dimacs\/026\/29"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","article-title":"Stabulus: A technique for finding stable sets in large graphs with tabu search","volume":"42","author":"Frieden","year":"1989","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB12","series-title":"Computers and intractibility: A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","article-title":"Hybrid evolutionary algorithms for graph coloring","volume":"3","author":"Galinier","year":"1999","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB14","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","article-title":"Solving the maximum clique problem using a tabu search approach","volume":"41","author":"Gendreau","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB15","unstructured":"C. Glass, Seminar at the Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland, 1999"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB16","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2013\u2013Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB17","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search\u2013\u2013Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB18","series-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","article-title":"An introduction to VNS","author":"Hansen","year":"1998"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB19","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","article-title":"Using tabu search techniques for graph coloring","volume":"39","author":"Hertz","year":"1987","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB20","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: An experimental evaluation, Part II: Graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB21","series-title":"Cliques, Coloring and Satisfiability","volume":"vol. 26","year":"1996"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB22","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB23","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovic","year":"1997","journal-title":"Computers in Operations Research"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB24","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1145\/358161.358171","article-title":"A correction to Br\u00e9laz\u2019s modification of Brown\u2019s coloring algorithm","volume":"26","author":"Peem\u00f6ller","year":"1983","journal-title":"Communications of ACM"},{"key":"10.1016\/S0377-2217(02)00832-9_BIB25","first-page":"191","article-title":"Heuristics for graph coloring","volume":"7","author":"de Werra","year":"1990","journal-title":"Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008329?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008329?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:24:12Z","timestamp":1553228652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0377221702008329"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00832-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}