{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:52:17Z","timestamp":1725501137345},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540757542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75755-9_130","type":"book-chapter","created":{"date-parts":[[2007,9,21]],"date-time":"2007-09-21T22:44:54Z","timestamp":1190414694000},"page":"1126-1135","source":"Crossref","is-referenced-by-count":1,"title":["Parallelization Techniques for Tabu Search"],"prefix":"10.1007","author":[{"given":"Jacek","family":"D\u0105browski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"130_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.: Variable Neighborhood Search for Graph Coloring. European Journal of Operational Research\u00a0151, 379\u2013388 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"130_CR2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.3846\/13926292.2005.9637283","volume":"10","author":"M.. Baravykait\u0117","year":"2005","unstructured":"Baravykait\u0117, M., \u010ciegis, R., \u017dilinskas, J.: Template realization of the generalized branch and bound algorithm. Mathematical Modelling and Analysis\u00a010(3), 217\u2013236 (2005)","journal-title":"Mathematical Modelling and Analysis"},{"key":"130_CR3","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 the Vertices of a Graph. Communications of the ACM\u00a022, 251\u2013256 (1979)","journal-title":"Communications of the ACM"},{"key":"130_CR4","unstructured":"Chiarandini, M., Dumitrescu, I., St\u00fclze, T.: Local Search for the Colouring Problem. A Computational Study. Technical Report AIDA-03-01, Darmstadt University of Technology (2003)"},{"key":"130_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/ijoc.9.1.61","volume":"9","author":"T.G. Crainic","year":"1997","unstructured":"Crainic, T.G., Toulouse, M., Gendreau, M.: Towards a Taxonomy of Parallel Tabu Search Heuristics. INFORMS Journal of Computing\u00a09, 61\u201372 (1997)","journal-title":"INFORMS Journal of Computing"},{"key":"130_CR6","volume-title":"Adaptive Memory and Evolution: Tabu Search and Scatter Search","author":"T.G. Crainic","year":"2002","unstructured":"Crainic, T.G.: Parallel Computation, Co-operation, Tabu Search. In: Rego, C., Alidaee, B. (eds.) Adaptive Memory and Evolution: Tabu Search and Scatter Search, Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"130_CR7","unstructured":"Johri, A., Matula, D.W.: Probabilistic bounds and heuristic algorithms for coloring large random graphs, Technical Report 82-CSE-6, Southern Methodist University (1982)"},{"key":"130_CR8","doi-asserted-by":"publisher","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. Journal of Combinatorial Optimization\u00a03, 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"130_CR9","doi-asserted-by":"crossref","unstructured":"Galinier, P., Hertz, A.: A survey of Local Search Methods for Graph Coloring. Computers & Operations Research (to appear)","DOI":"10.1016\/j.cor.2005.07.028"},{"key":"130_CR10","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"}],"container-title":["Lecture Notes in Computer Science","Applied Parallel Computing. State of the Art in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75755-9_130.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:30:58Z","timestamp":1619505058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75755-9_130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540757542"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75755-9_130","relation":{},"subject":[]}}