{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T05:07:59Z","timestamp":1769922479255,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,29]],"date-time":"2012-04-29T00:00:00Z","timestamp":1335657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00186-012-0387-4","type":"journal-article","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T06:09:46Z","timestamp":1335593386000},"page":"1-20","source":"Crossref","is-referenced-by-count":10,"title":["Approximation algorithms for TTP(2)"],"prefix":"10.1007","volume":"76","author":[{"given":"Clemens","family":"Thielen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Westphal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,29]]},"reference":[{"issue":"2","key":"387_CR1","doi-asserted-by":"crossref","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 (2006) A simulated annealing approach to the travelling tournament problem. J Sched 9(2): 177\u2013193","journal-title":"J Sched"},{"key":"387_CR2","unstructured":"Bhattacharyya R (2009) A note on complexity of traveling tournament problem. Optimization Online"},{"key":"387_CR3","first-page":"15","volume-title":"Management science in sports, studies in the management sciences","author":"RT Campbell","year":"1976","unstructured":"Campbell RT, Chen DS (1976) A minimum distance basketball scheduling problem. In: Machol RE, Ladany SP, Morrison D (eds) Management science in sports, studies in the management sciences. North-Holland Publishing Company, North-Holland, pp 15\u201325"},{"key":"387_CR4","volume-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"N Christofides","year":"1976","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh"},{"key":"387_CR5","doi-asserted-by":"crossref","unstructured":"de Werra D (1981) Scheduling in sports. In: Studies on graphs and discrete programming, Ann Discret Math, vol 11, pp 381\u2013395. North-Holland Publishing Company, North-Holland","DOI":"10.1016\/S0304-0208(08)73478-9"},{"key":"387_CR6","doi-asserted-by":"crossref","unstructured":"Easton K, Nemhauser G, Trick M (2001) The traveling tournament problem description and benchmarks. In: Proceedings of the 7th international conference on principles and practice of constraint programming (CP), LNCS, vol 2239, pp 580\u2013584","DOI":"10.1007\/3-540-45578-7_43"},{"key":"387_CR7","doi-asserted-by":"crossref","unstructured":"Easton K, Nemhauser G, Trick M (2003) Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In: Proceedings of the 4th international conference on the practice and theory of automated timetabling (PATAT), LNCS, vol 2740, pp 100\u2013109","DOI":"10.1007\/978-3-540-45157-0_6"},{"issue":"1","key":"387_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","volume":"37","author":"G Kendall","year":"2010","unstructured":"Kendall G, Knust S, Ribeiro C, Urrutia S (2010) Scheduling in sports: an annotated bibliography. Comput Oper Res 37(1): 1\u201319","journal-title":"Comput Oper Res"},{"key":"387_CR9","doi-asserted-by":"crossref","unstructured":"Miyashiro R, Matsui T, Imahori S (2012) An approximation algorithm for the traveling tournament problem. Ann Oper Res (online). doi: 10.1007\/s10479-010-0742-x","DOI":"10.1007\/s10479-010-0742-x"},{"key":"387_CR10","unstructured":"Miyashiro R, Matsui T, Imahori S (2008) An approximation algorithm for the traveling tournament problem. In: Proceedings of the 7th international conference on the practice and theory of automated timetabling (PATAT)"},{"key":"387_CR11","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"R Rasmussen","year":"2008","unstructured":"Rasmussen R, Trick M (2008) Round robin scheduling\u2014a survey. Eur J Oper Res 188: 617\u2013636","journal-title":"Eur J Oper Res"},{"issue":"4-5","key":"387_CR12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.tcs.2010.10.001","volume":"412","author":"C Thielen","year":"2011","unstructured":"Thielen C, Westphal S (2011) Complexity of the traveling tournament problem. Theor Comput Sci 412(4-5): 345\u2013351","journal-title":"Theor Comput Sci"},{"key":"387_CR13","unstructured":"Trick M (2011) Challenge traveling tournament instances. http:\/\/mat.gsia.cmu.edu\/TOURN\/"},{"key":"387_CR14","unstructured":"Westphal S, Noparlik K (2010) A 5.875-approximation for the traveling tournament problem. In: Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT)"},{"key":"387_CR15","doi-asserted-by":"crossref","unstructured":"Westphal S, Noparlik K (2012) A 5.875-approximation for the traveling tournament problem. Ann Oper Res (online). doi: 10.1007\/s10479-012-1061-1","DOI":"10.1007\/s10479-012-1061-1"},{"key":"387_CR16","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1007\/s00453-011-9579-1","volume":"61","author":"D Yamaguchi","year":"2011","unstructured":"Yamaguchi D, Imahori S, Miyashiro R, Matsui T (2011) An improved approximation algorithm for the traveling tournament problem. Algorithmica 61: 1077\u20131091","journal-title":"Algorithmica"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0387-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0387-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0387-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:30Z","timestamp":1558607610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0387-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,29]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["387"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0387-4","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,29]]}}}