{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T20:18:10Z","timestamp":1777407490288,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10951-006-7187-8","type":"journal-article","created":{"date-parts":[[2006,4,25]],"date-time":"2006-04-25T19:49:33Z","timestamp":1145994573000},"page":"177-193","source":"Crossref","is-referenced-by-count":109,"title":["A simulated annealing approach to the traveling tournament problem"],"prefix":"10.1007","volume":"9","author":[{"given":"A.","family":"Anagnostopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Michel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Van","family":"Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Vergados","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7187_CR1","unstructured":"Benoist, T., F. Laburthe, and B. Rottembourg, \u201cLagrange relaxation and constraint programming collaborative schemes for travelling tournament problems,\u201d in CP-AI-OR'2001, Wye College (Imperial College), Ashford, Kent UK, April 2001."},{"key":"7187_CR2","doi-asserted-by":"crossref","unstructured":"Connelly, D. T., \u201cGeneral purpose simulated annealing.\u201d Journal of Operations Research, 43, (1992).","DOI":"10.2307\/2583568"},{"issue":"1","key":"7187_CR3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0377-2217(00)00108-9","volume":"132","author":"Juan A. D\u00edaz","year":"July 2001","unstructured":"D\u00edaz, Juan A. and E. Fern\u00e1ndez, \u201cA tabu search heuristic for the generalized assignment problem,\u201d European Journal of Operational Research, 132(1), 22\u201338, (July 2001).","journal-title":"European Journal of Operational Research"},{"key":"7187_CR4","doi-asserted-by":"crossref","unstructured":"Easton, K., G. Nemhauser, and M. Trick, \u201cThe traveling tournament problem description and benchmarks,\u201d in Seventh International Conference on the Principles and Practice of Constraint Programming (CP'99), Paphos, Cyprus. Springer-Verlag, LNCS 2239, (2001) pp. 580\u2013589.","DOI":"10.1007\/3-540-45578-7_43"},{"key":"7187_CR5","doi-asserted-by":"crossref","unstructured":"Glover, F. and M. Laguna, Tabu Search. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"7187_CR6","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., C. Gelatt, and M. Vecchi, \u201cOptimization by simulated annealing,\u201d Science, 220, 671\u2013680 (1983).","journal-title":"Science"},{"key":"7187_CR7","unstructured":"Laguna, M., J. P. Kelly, Gonzalez-Velarde, and F. Glover, \u201cTabu search for the multilevel generalized assignment problems,\u201d European Journal of Operational Research, 42, 677\u2013687 (1995)."},{"key":"7187_CR8","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H., \u201cMetastrategy simulated annealing and tabu search algorithms for the vehicle routing problem,\u201d Annals of Operations Research, 41, 421\u2013451 (1993).","journal-title":"Annals of Operations Research"},{"key":"7187_CR9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E. Pesch","year":"1997","unstructured":"Pesch, E. and F. Glover, \u201cTSP Ejection Chains,\u201d Discrete Applied Mathematics, 76, 165\u2013181, (1997).","journal-title":"Discrete Applied Mathematics"},{"key":"7187_CR10","unstructured":"Trick, M. http:\/\/mat.gsia.cmu.edu\/TOURN\/, 2002."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-7187-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-7187-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-7187-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:39Z","timestamp":1559468379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-7187-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["7187"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-7187-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}