{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:36:16Z","timestamp":1760708176856,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664437"},{"type":"electronic","value":"9783540483113"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48311-x_75","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"533-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning"],"prefix":"10.1007","author":[{"given":"Michel","family":"Toulouse","sequence":"first","affiliation":[]},{"given":"Krishnaiyan","family":"Thulasiraman","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"issue":"1","key":"75_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"F. Glover. Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences, 8(1):156\u2013166, 1977.","journal-title":"Decision Sciences"},{"key":"75_CR2","doi-asserted-by":"crossref","unstructured":"F. Glover. Ejection Chains, Reference Structures and Alternating Path Methods for the Traveling Salesman Problem. Report, University of Colorado, Boulder, 1992.","DOI":"10.1016\/B978-0-08-040806-4.50037-X"},{"key":"75_CR3","series-title":"Lect Notes Comput Sci","volume-title":"A Template for Scatter Search and Path Relinking","author":"F. Glover","year":"1997","unstructured":"F. Glover. A Template for Scatter Search and Path Relinking. In J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers, editors, Lecture Notes in computer Science, 1997."},{"key":"75_CR4","unstructured":"F. Glover and M. Laguna. Tabu Search. In C. Reeves, editor, Modern Heuristic Techniques for Combinatorial Problems, pages 70\u2013141. Blackwell Scientific Publishing, 1993."},{"key":"75_CR5","doi-asserted-by":"crossref","unstructured":"F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"75_CR6","unstructured":"B. Hendrickson and R. Leland. A Multilevel Algorithm for Partitioning Graphs. Report SAND93-1301, Sandia National Laboratories, 1993."},{"key":"75_CR7","unstructured":"B. Hendrickson and R. Leland. The Chaco User\u2019s Guide: Version 2.0. Report SAND95-2344, Sandia National Laboratories, 1995."},{"key":"75_CR8","unstructured":"G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM Journal on Scientific Computing, to appear."},{"key":"75_CR9","unstructured":"G. Karypis and V. Kumar. A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices: Version 3.0. Report, University of Minnesota, 1997."},{"key":"75_CR10","unstructured":"J.P. Kelly and J. Xu. Tabu Search and Vocabulary Building for Routing Problems. Technical report, Graduate School of Business Administration, University of Colorado at Boulder, 1995."},{"key":"75_CR11","unstructured":"L. Lopez, M.W. Carter, and M. Gendreau. The Hot StripMill Production Scheduling Problem: A Tabu Search Approach. Report, Center for Research on Transportation, Universit\u00e9 de Montr\u00e9al, 1996."},{"issue":"1","key":"75_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Y. Rochat and E. Taillard. Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics, 1(1):147\u2013167, 1995.","journal-title":"Journal of Heuristics"},{"key":"75_CR13","unstructured":"E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. A New Neighborhood Structure for Vehicule Routing with Time Window. Report CRT-95-66, Center for Research on Transportation, Universit\u00e9 de Montr\u00e9al, 1995."},{"key":"75_CR14","doi-asserted-by":"crossref","unstructured":"M. Toulouse, T.G. Crainic, and B. San\u015bo. An Experimental Study of Systemic Behavior of Cooperative Search Algorithms. In I.H. Osman S. Voss, S. Martello and C. Roucairol, editors, Meta-Heuristics: Theory and Applications, pages 373\u2013392. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4615-5775-3_26"}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T14:55:33Z","timestamp":1600354533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}