{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:35:15Z","timestamp":1725496515700},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540773443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77345-0_9","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T05:53:06Z","timestamp":1195883586000},"page":"135-146","source":"Crossref","is-referenced-by-count":3,"title":["Constructive Algorithms for the Constant Distance Traveling Tournament Problem"],"prefix":"10.1007","author":[{"given":"Nobutomo","family":"Fujiwara","sequence":"first","affiliation":[]},{"given":"Shinji","family":"Imahori","sequence":"additional","affiliation":[]},{"given":"Tomomi","family":"Matsui","sequence":"additional","affiliation":[]},{"given":"Ryuhei","family":"Miyashiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","volume":"9","author":"A. Anagnostopoulos","year":"2006","unstructured":"Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. Journal of Scheduling\u00a09, 177\u2013193 (2006)","journal-title":"Journal of Scheduling"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0166-218X(80)90028-1","volume":"2","author":"D. Werra de","year":"1980","unstructured":"de Werra, D.: Geography, games and graphs. Discrete Applied Mathematics\u00a02, 327\u2013337 (1980)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/3-540-45578-7_43","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"K. Easton","year":"2001","unstructured":"Easton, K., Nemhauser, G., Trick, M.: The traveling tournament problem: description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 580\u2013585. Springer, Heidelberg (2001)"},{"unstructured":"ILOG: ILOG CPLEX 9.0 (2003)","key":"9_CR4"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-540-45157-0_5","volume-title":"Practice and Theory of Automated Timetabling IV","author":"R. Miyashiro","year":"2003","unstructured":"Miyashiro, R., Iwasaki, H., Matsui, T.: Characterizing feasible pattern sets with a minimum number of breaks. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 78\u201399. Springer, Heidelberg (2003)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.orl.2004.06.004","volume":"33","author":"R. Miyashiro","year":"2005","unstructured":"Miyashiro, R., Matsui, T.: A polynomial-time algorithm to find an equitable home\u2013away assignment. Operations Research Letters\u00a033, 235\u2013241 (2005)","journal-title":"Operations Research Letters"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ejor.2005.10.063","volume":"177","author":"R.V. Rasmussen","year":"2007","unstructured":"Rasmussen, R.V., Trick, M.A.: A Benders approach for the constrained minimum break problem. European Journal of Operational Research\u00a0177, 198\u2013213 (2007)","journal-title":"European Journal of Operational Research"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11757375_15","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"R.V. Rasmussen","year":"2006","unstructured":"Rasmussen, R.V., Trick, M.A.: The timetable constrained distance minimization problem. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol.\u00a03990, pp. 167\u2013181. Springer, Heidelberg (2006)"},{"unstructured":"Rasmussen, R.V., Trick, M.A.: Round robin scheduling \u2013 a survey. Working Paper 2006\/2, Department of Operations Research, University of Aarhus (2006)","key":"9_CR9"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2005.03.061","volume":"179","author":"C.C. Ribeiro","year":"2007","unstructured":"Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. European Journal of Operational Research\u00a0179, 775\u2013787 (2007)","journal-title":"European Journal of Operational Research"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1287\/opre.42.4.614","volume":"42","author":"R.A. Russell","year":"1994","unstructured":"Russell, R.A., Leung, J.M.Y.: Devising a cost effective schedule for a baseball league. Operations Research\u00a042, 614\u2013625 (1994)","journal-title":"Operations Research"},{"unstructured":"Trick,\u00a0M.: Challenge traveling tournament problem (2006), \n                    \n                      http:\/\/mat.gsia.cmu.edu\/TOURN\/","key":"9_CR12"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1932","DOI":"10.1016\/j.dam.2006.03.030","volume":"154","author":"S. Urrutia","year":"2006","unstructured":"Urrutia, S., Ribeiro, C.C.: Maximizing breaks and bounding solutions to the mirrored traveling tournament problem. Discrete Applied Mathematics\u00a0154, 1932\u20131938 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/11757375_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Hentenryck Van","year":"2006","unstructured":"Van Hentenryck, P., Vergados, Y.: Traveling tournament scheduling: a systematic evaluation of simulated annealing. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol.\u00a03990, pp. 228\u2013243. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77345-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:09:02Z","timestamp":1619521742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77345-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773443"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77345-0_9","relation":{},"subject":[]}}