{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:39:07Z","timestamp":1648715947494},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,6]],"date-time":"2008-03-06T00:00:00Z","timestamp":1204761600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10852-008-9081-1","type":"journal-article","created":{"date-parts":[[2008,3,5]],"date-time":"2008-03-05T11:16:23Z","timestamp":1204715783000},"page":"125-142","source":"Crossref","is-referenced-by-count":0,"title":["A Cooperative Search Method for the k-Coloring Problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Hend","family":"Bouziri","sequence":"first","affiliation":[]},{"given":"El-Ghazali","family":"Talbi","sequence":"additional","affiliation":[]},{"given":"Khaled","family":"Mellouli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,6]]},"reference":[{"key":"9081_CR1","unstructured":"Bachelet, V.: M\u00e9taheuristiques parall\u00e8les hybrides: application au probl\u00e8me d\u2019affectation quadratique. PhD Thesis, Universit\u00e9 des Sciences et Technologies de Lille, France, Janvier (2000)"},{"key":"9081_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color vertices of a graph. Commun. ACM 22, 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"issue":"2","key":"9081_CR3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M. Chams","year":"1987","unstructured":"Chams, M., Hertz, A., de Werra, D.: Some experiments with simulated annealing for coloring graphs. Eur. J. Oper. Res. 32(2), 260\u2013266 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR5","unstructured":"Culberson, J.: Frozen development in graph coloring. Technical Report APES-19-2000, APES Research Group (2000) February 1"},{"key":"9081_CR6","unstructured":"Desrosiers, C., Galinier, P., Hertz, A.: Efficient Algorithms for Finding Critical Subgraphs. Les Cahiers de GEARD G-2004-31 (2004) April"},{"key":"9081_CR8","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1995","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63, 437\u2013461 (1995)","journal-title":"Ann. Oper. Res."},{"key":"9081_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C. Friden","year":"1989","unstructured":"Friden, C., Hertz, A., de Werra, D.: Stabulus, a technique for finding stable sets in large graphs with tabu search. Computing 42, 35\u201344 (1989)","journal-title":"Computing"},{"issue":"4","key":"9081_CR11","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid evolutionary algorithm for graph coloring. J. Comb. Optim. 3(4), 379\u2013397 (1999)","journal-title":"J. Comb. Optim."},{"key":"9081_CR12","unstructured":"Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the k-colouring problem. Les cahiers de GERAD G-2003-35, GERAD, Montr\u00e9al (2003)"},{"key":"9081_CR13","unstructured":"Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Les cahiers de GIRAD G-2004-32, GERAD, Montr\u00e9al (2004)"},{"key":"9081_CR14","unstructured":"Hamiez, J.P., Hao, J.K: An analysis of solution properties of the graph coloring problem MIC\u20192001. 4th Metaheuristics International Conference, Porto, Portugal pp. 16\u201320 (2001) July"},{"key":"9081_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39, 345\u2013351 (1987)","journal-title":"Computing"},{"key":"9081_CR16","unstructured":"Hordijk, W.: A mesure of landscapes. Technical report 95-045-049, Santa Fe Institute, Santa Fe, New Mexico, USA (1995) May"},{"key":"9081_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(94)90212-7","volume":"49","author":"A. Hertz","year":"1994","unstructured":"Hertz, A., Jaumard, B., de Aragao, M.P.: Local optima topology for the k-coloring problem. Discrete Appl. Math. 49, 257\u2013280 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9081_CR18","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation: part II, graph coloring and number partitioning. Oper. Res. 39(3), 378\u2013406 (1991)","journal-title":"Oper. Res."},{"key":"9081_CR20","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. Santa Fe Institute, Working Paper 95-02-022 (1995)"},{"key":"9081_CR21","unstructured":"Laguna, M., Marti, R.: A GRASP for coloring sparse graphs. Technical Report (1999) November 17"},{"key":"9081_CR22","first-page":"335","volume":"26","author":"C. Morgenstern","year":"1996","unstructured":"Morgenstern, C.: Distributed coloration neighborhood search. Discrete Mathematics and Theoretical computer science, Am. Math. Soc. 26, 335\u2013358 (1996)","journal-title":"Am. Math. Soc."},{"key":"9081_CR24","unstructured":"Weinberg, B.: Analyse et r\u00e9solution approch\u00e9e de probl\u00e8mes d\u2019optimisation combinatoire: application au probl\u00e8me de coloration de graphe. Ph.D. Thesis, Universit\u00e9 des Sciences et Technologies de Lille, France (2004)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9081-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-008-9081-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9081-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:30Z","timestamp":1559269590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-008-9081-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9081"],"URL":"https:\/\/doi.org\/10.1007\/s10852-008-9081-1","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,6]]}}}