{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:06Z","timestamp":1725522246389},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926948"},{"type":"electronic","value":"9783540926955"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92695-5_13","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T10:11:59Z","timestamp":1229422319000},"page":"167-176","source":"Crossref","is-referenced-by-count":0,"title":["A Vector Assignment Approach for the Graph Coloring Problem"],"prefix":"10.1007","author":[{"given":"Takao","family":"Ono","sequence":"first","affiliation":[]},{"given":"Mutsunori","family":"Yagiura","sequence":"additional","affiliation":[]},{"given":"Tomio","family":"Hirata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_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"},{"key":"13_CR2","doi-asserted-by":"publisher","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. Communications of the ACM\u00a022, 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2002","unstructured":"Burer, S., Monteiro, R.D.C., Zhang, Y.: Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM Journal on Optimization\u00a012(2), 503\u2013521 (2002)","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.20035","volume":"44","author":"M. Caramia","year":"2004","unstructured":"Caramia, M., Dell\u2019Olmo, P.: Bounding vertex coloring by trancated Multistage branch and bound. Networks\u00a044(4), 231\u2013242 (2004)","journal-title":"Networks"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G. Dueck","year":"1990","unstructured":"Dueck, G., Scheuer, T.: Threshold accepting: A generel purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics\u00a090, 161\u2013175 (1990)","journal-title":"Journal of Computational Physics"},{"key":"13_CR6","unstructured":"Eiben, A., van der Hauw, J.: Grpah coloring with adaptive genetic algorithms. Technical Report TR96-11, Leiden University (August 1996)"},{"key":"13_CR7","doi-asserted-by":"publisher","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\u00a039, 345\u2013351 (1987)","journal-title":"Computing"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Hertz, A., Plumettaz, M., Zufferey, N.: Variable space search for graph coloring, Working Paper (2007)","DOI":"10.1016\/j.dam.2008.03.022"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","volume":"40","author":"W.L. Hsu","year":"1991","unstructured":"Hsu, W.L., Tsai, K.H.: Linear time algorithms on circular-arc graphs. Information Processing Letters\u00a040, 123\u2013129 (1991)","journal-title":"Information Processing Letters"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"D. Karger","year":"1998","unstructured":"Karger, D., Motwani, R., Sudan, M.: Approximate graph coloring by semidefinite programming. Journal of the ACM\u00a045(2), 246\u2013265, 3 (1998)","journal-title":"Journal of the ACM"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00453-002-1006-1","volume":"36","author":"M.J. Katz","year":"2003","unstructured":"Katz, M.J., Nielsen, F., Segal, M.: Maintenance of a piercing set for intervals with applications. Algorithmica\u00a036(1), 59\u201373 (2003)","journal-title":"Algorithmica"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"G.A. Kochenberger","year":"2005","unstructured":"Kochenberger, G.A., Glover, F., Alidaee, B., Rego, C.: An unconstrained quadratic binary programming approach to the vertex coloring problem. Annals of Operations Research\u00a0139(1), 229\u2013241 (2005)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1011237503342","volume":"19","author":"M. Laguna","year":"2001","unstructured":"Laguna, M., Mart\u00ed, R.: A GRASP for coloring sparse graphs. Computational Optimization and Applications\u00a019(2), 165\u2013178 (2001)","journal-title":"Computational Optimization and Applications"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-74446-7_20","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics","author":"N. Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107, N., Plastria, F., Uro\u0161evi\u0107, D.: Formulation space search for circle packing problems. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol.\u00a04638, pp. 212\u2013216. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92695-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T09:21:51Z","timestamp":1557998511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92695-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926948","9783540926955"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92695-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}