{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:43:43Z","timestamp":1725615823107},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_25","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:56:32Z","timestamp":1182527792000},"page":"346-360","source":"Crossref","is-referenced-by-count":10,"title":["A Large Neighborhood Search Heuristic for Graph Coloring"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Trick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"Yildiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C. Avanthay","year":"2003","unstructured":"Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for graph coloring. European Journal of Operational Research\u00a0151, 379\u2013388 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"25_CR3","unstructured":"Bui, T.N., Patel, C.M.: An Ant System Algorithm for Coloring Graphs. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, NY (2002)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2001","unstructured":"Burer, S., Monteiro, R.D.C., Zhang, T.: Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs. SIAM Journal on Optimization\u00a012, 503\u2013521 (2001)","journal-title":"SIAM Journal on Optimization"},{"key":"25_CR5","unstructured":"Chiarandini, M., Dumitrescu, I., Stuetzle, T.: Local search for the colouring graph problem. A computational study. Technical Report AIDA-03-01, FG Intellektik, TU Darmstadt (2003)"},{"key":"25_CR6","unstructured":"Chiarandini, M., Stuetzle, T.: An application of Iterated Local Search to Graph Coloring Problem. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, NY (2002)"},{"key":"25_CR7","unstructured":"CirCut: A Fortran 90 Code for Max-Cut, Max-Bisection and More, \n                  \n                    http:\/\/www.caam.rice.edu\/~zhang\/circut\/"},{"key":"25_CR8","unstructured":"COLOR02\/03\/04: Graph Coloring and its Generalizations, \n                  \n                    http:\/\/mat.gsia.cmu.edu\/COLOR04"},{"key":"25_CR9","unstructured":"Croitoru, C., Luchian, H., Gheorghies, O., Apetrei, A.: A New Genetic Graph Coloring Heuristic. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, NY (2002)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P. Galinier","year":"2006","unstructured":"Galinier, P., Hertz, A.: A Survey of Local Search Methods for Graph Coloring. Computers & Operations Research\u00a033, 2547\u20132562 (2006)","journal-title":"Computers & Operations Research"},{"key":"25_CR11","unstructured":"Galinier, P., Hertz, A., Zufferey, N.: Adaptive Memory Algorithms for Graph Coloring. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, NY (2002)"},{"key":"25_CR12","volume-title":"Computers and Interactibility: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Interactibility: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of ACM"},{"issue":"4","key":"25_CR14","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.: A column generation approach for graph coloring. INFORMS Journal On Computing\u00a08(4), 344\u2013354 (1996)","journal-title":"INFORMS Journal On Computing"},{"key":"25_CR15","unstructured":"Phan, V., Skiena, S.: Coloring Graphs With a General Heuristic Search Engine. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, Ithaca, NY (2002)"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P.M. Thompson","year":"1993","unstructured":"Thompson, P.M., Psaraftis, H.N.: Cyclic transfer algorithms for multivehicle routing and scheduling problems. Operations Research\u00a041, 70\u201379 (1993)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T06:45:01Z","timestamp":1550385901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}