{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:31:00Z","timestamp":1761888660813,"version":"build-2065373602"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s13675-013-0010-3","type":"journal-article","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T23:27:37Z","timestamp":1367364457000},"page":"77-86","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["A complete search method for the relaxed traveling tournament problem"],"prefix":"10.1016","volume":"2","author":[{"given":"Filipe","family":"Brand\u00e3o","sequence":"first","affiliation":[]},{"given":"Jo\u00e3oPedro","family":"Pedroso","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-013-0010-3_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","article-title":"A simulated annealing approach to the traveling tournament problem","volume":"9","author":"Anagnostopoulos","year":"2006","journal-title":"J Sched"},{"key":"10.1007\/s13675-013-0010-3_CR2","unstructured":"Bao R (2006) Time relaxed round Robin Tournament and the NBA Scheduling Problem. Cleveland State University, Master\u2019s thesis"},{"key":"10.1007\/s13675-013-0010-3_CR3","doi-asserted-by":"crossref","unstructured":"Easton K, Nemhauser G, Trick MA (2001) The traveling tournament problem description and benchmarks. Tepper School of Business","DOI":"10.1007\/3-540-45578-7_43"},{"key":"10.1007\/s13675-013-0010-3_CR4","doi-asserted-by":"crossref","unstructured":"Easton K, Nemhauser GL, Trick MA (2002) Solving the travelling tournament problem: a combined integer programming and constraint programming approach. In: Burke EK, Causmaecker PD (eds) PATAT, volume 2740 of Lecture Notes in Computer Science. Springer, Berlin, pp 100\u2013112","DOI":"10.1007\/978-3-540-45157-0_6"},{"key":"10.1007\/s13675-013-0010-3_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","article-title":"Scheduling in sports: an annotated bibliography","volume":"37","author":"Kendall","year":"2010","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13675-013-0010-3_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: an optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artif Intell"},{"key":"10.1007\/s13675-013-0010-3_CR7","unstructured":"Trick M (2012) Challenge traveling tournament problems. http:\/\/mat.gsia.cmu.edu\/TOURN. Accessed 15 Feb 2013"},{"key":"10.1007\/s13675-013-0010-3_CR8","doi-asserted-by":"crossref","unstructured":"Uthus DC, Riddle PJ, Guesgen HW (2009) DFS* and the traveling tournament problem. In: van Hoeve WJ, Hooker JN (eds) CPAIOR, volume 5547 of Lecture Notes in Computer Science, Springer, Berlin, pp 279\u2013293","DOI":"10.1007\/978-3-642-01929-6_21"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0010-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-013-0010-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000265?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000265?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0010-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:20Z","timestamp":1761882320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["S2192440621000265"],"URL":"https:\/\/doi.org\/10.1007\/s13675-013-0010-3","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A complete search method for the relaxed traveling tournament problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-013-0010-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}