{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:11:06Z","timestamp":1761621066644},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T00:00:00Z","timestamp":1305590400000},"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":[[2012,10]]},"DOI":"10.1007\/s10951-011-0237-x","type":"journal-article","created":{"date-parts":[[2011,5,16]],"date-time":"2011-05-16T15:22:20Z","timestamp":1305559340000},"page":"601-614","source":"Crossref","is-referenced-by-count":10,"title":["Solving the traveling tournament problem with iterative-deepening A\u2217"],"prefix":"10.1007","volume":"15","author":[{"given":"David C.","family":"Uthus","sequence":"first","affiliation":[]},{"given":"Patricia J.","family":"Riddle","sequence":"additional","affiliation":[]},{"given":"Hans W.","family":"Guesgen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,17]]},"reference":[{"key":"237_CR1","first-page":"15","volume-title":"CP-AI-OR 2001","author":"T. Benoist","year":"2001","unstructured":"Benoist,\u00a0T., Laburthe,\u00a0F., & Rottembourg,\u00a0B. (2001). Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In CP-AI-OR 2001 (pp. 15\u201326). Wye College, UK."},{"key":"237_CR2","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter,\u00a0R. (2003). Constraint processing. San Francisco: Morgan Kaufmann."},{"key":"237_CR3","first-page":"580","volume-title":"Lecture notes in computer science","author":"K. Easton","year":"2001","unstructured":"Easton,\u00a0K., Nemhauser,\u00a0G.\u00a0L., & Trick,\u00a0M.\u00a0A. (2001). The traveling tournament problem: Description and benchmarks. In T.\u00a0Walsh (Ed.), Lecture notes in computer science (Vol.\u00a02239, pp. 580\u2013584). Berlin: Springer."},{"key":"237_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-540-45157-0_6","volume-title":"Practice and theory of automated timetabling IV","author":"K. Easton","year":"2003","unstructured":"Easton,\u00a0K., Nemhauser,\u00a0G., & Trick,\u00a0M. (2003). Solving the travelling tournament problem: A\u00a0combined integer programming and constraint programming approach. In Lecture notes in computer science: Vol. 2740. Practice and theory of automated timetabling IV (pp. 100\u2013109). Berlin\/Heidelberg: Springer."},{"issue":"2","key":"237_CR5","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.ejor.2010.08.015","volume":"210","author":"T. Gschwind","year":"2011","unstructured":"Gschwind,\u00a0T., & Irnich,\u00a0S. (2011). A note on symmetry reduction for circular traveling tournament problems. European Journal of Operational Research, 210(2), 452\u2013456.","journal-title":"European Journal of Operational Research"},{"key":"237_CR6","first-page":"93","volume-title":"ParCo\u201995","author":"Z. Hafidi","year":"1995","unstructured":"Hafidi,\u00a0Z., Talbi,\u00a0E.\u00a0G., & Goncalves,\u00a0G. (1995). Load balancing and parallel tree search: the MPIDA\u2217 algorithm. In E.\u00a0H.\u00a0D\u2019Hollander, G.\u00a0R.\u00a0Joubert, F.\u00a0J.\u00a0Peters, & D.\u00a0Trystram (Eds.), ParCo\u201995 (pp. 93\u2013100). Amsterdam: Elsevier."},{"issue":"2","key":"237_CR7","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.ejor.2009.10.024","volume":"204","author":"S. Irnich","year":"2010","unstructured":"Irnich,\u00a0S. (2010). A\u00a0new branch-and-price algorithm for the traveling tournament problem. European Journal of Operational Research, 204(2), 218\u2013228.","journal-title":"European Journal of Operational Research"},{"key":"237_CR8","unstructured":"Irnich,\u00a0S., & Schrempp,\u00a0U. (2008). A\u00a0new branch-and-price algorithm for the traveling tournament problem. Presented at Column Generation 2008, Aussois, France, June 17\u201320, 2008. Available from: http:\/\/www.gerad.ca\/colloques\/ColumnGeneration2008\/slides\/SIrnich.pdf [Accessed 28 Nov, 2010]."},{"issue":"1","key":"237_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","volume":"37","author":"G. Kendall","year":"2010","unstructured":"Kendall,\u00a0G., Knust,\u00a0S., Ribeiro,\u00a0C.\u00a0C., & Urrutia,\u00a0S. (2010). Scheduling in sports: an annotated bibliography. Computers & Operations Research, 37(1), 1\u201319.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"237_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.\u00a0E. Korf","year":"1985","unstructured":"Korf,\u00a0R.\u00a0E. (1985). Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27(1), 97\u2013109.","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"237_CR11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0004-3702(01)00092-3","volume":"134","author":"R.\u00a0E. Korf","year":"2002","unstructured":"Korf,\u00a0R.\u00a0E., & Felner,\u00a0A. (2002). Disjoint pattern database heuristics. Artificial Intelligence, 134(1\u20132), 9\u201322.","journal-title":"Artificial Intelligence"},{"issue":"5","key":"237_CR12","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1109\/34.134045","volume":"13","author":"C. Powley","year":"1991","unstructured":"Powley,\u00a0C., & Korf,\u00a0R. (1991). Single-agent parallel window search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(5), 466\u2013477.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"237_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0004-3702(93)90002-S","volume":"60","author":"C. Powley","year":"1993","unstructured":"Powley,\u00a0C., Ferguson,\u00a0C., & Korf,\u00a0R.\u00a0E. (1993). Depth-first heuristic search on a SIMD machine. Artificial Intelligence, 60(2), 199\u2013242.","journal-title":"Artificial Intelligence"},{"key":"237_CR14","first-page":"178","volume-title":"Proceedings of AAAI","author":"V.\u00a0N. Rao","year":"1987","unstructured":"Rao,\u00a0V.\u00a0N., Kumar,\u00a0V., & Ramesh,\u00a0K. (1987). A\u00a0parallel implementation of iterative-deepening-A\u2217. In Proceedings of AAAI (pp. 178\u2013182)."},{"issue":"3","key":"237_CR15","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.ejor.2007.05.046","volume":"188","author":"R. V. Rasmussen","year":"2008","unstructured":"Rasmussen,\u00a0R. V., & Trick,\u00a0MA (2008). Round robin scheduling\u2014a\u00a0survey. European Journal of Operational Research, 188(3), 617\u2013636.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"237_CR16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(91)90100-X","volume":"50","author":"U. K. Sarkar","year":"1991","unstructured":"Sarkar,\u00a0U. K., Chakrabarti,\u00a0P. P., Ghose,\u00a0S., & De Sarkar,\u00a0S.\u00a0C. (1991). Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Artificial Intelligence, 50(2), 207\u2013221.","journal-title":"Artificial Intelligence"},{"key":"237_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/0470053925","volume-title":"Parallel combinatorial optimization","author":"E.\u00a0G. Talbi","year":"2006","unstructured":"Talbi,\u00a0E.\u00a0G. (2006). Parallel combinatorial optimization. Hoboken: Wiley."},{"key":"237_CR18","unstructured":"Trick,\u00a0M.\u00a0A. (2010). Challenge traveling tournament problems. http:\/\/mat.gsia.cmu.edu\/TOURN\/ ."},{"issue":"13","key":"237_CR19","doi-asserted-by":"crossref","first-page":"1932","DOI":"10.1016\/j.dam.2006.03.030","volume":"154","author":"S. Urrutia","year":"2006","unstructured":"Urrutia,\u00a0S., & Ribeiro,\u00a0C.\u00a0C. (2006). Maximizing breaks and bounding solutions to the mirrored traveling tournament problem. Discrete Applied Mathematics, 154(13):1932\u20131938.","journal-title":"Discrete Applied Mathematics"},{"key":"237_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/SCIS.2007.367664","volume-title":"IEEE symposium on computational intelligence in scheduling","author":"S. Urrutia","year":"2007","unstructured":"Urrutia,\u00a0S., Ribeiro,\u00a0C., & Melo,\u00a0R. (2007). A new lower bound to the traveling tournament problem. In IEEE symposium on computational intelligence in scheduling (pp. 15\u201318)."},{"key":"237_CR21","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/1569901.1569913","volume-title":"GECCO","author":"D.\u00a0C. Uthus","year":"2009","unstructured":"Uthus,\u00a0D.\u00a0C., Riddle,\u00a0P.\u00a0J., & Guesgen,\u00a0H.\u00a0W. (2009a). An ant colony optimization approach to the traveling tournament problem. In: F.\u00a0Rothlauf (Ed.), GECCO (pp. 81\u201388). New York: ACM."},{"key":"237_CR22","first-page":"279","volume-title":"CPAIOR\u201909","author":"D.\u00a0C. Uthus","year":"2009","unstructured":"Uthus,\u00a0D.\u00a0C., Riddle,\u00a0P.\u00a0J., & Guesgen,\u00a0H.\u00a0W. (2009b). DFS\u2217 and the traveling tournament problem. In: CPAIOR\u201909 (pp. 279\u2013293). Berlin\/Heidelberg: Springer."},{"key":"237_CR23","first-page":"434","volume-title":"Proceedings of AAAI-91","author":"N. Vempaty","year":"1991","unstructured":"Vempaty,\u00a0N., Kumar,\u00a0V., & Korf,\u00a0R. (1991). Depth-first vs best-first search. In Proceedings of AAAI-91 (pp. 434\u2013440)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0237-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0237-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0237-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:46Z","timestamp":1559453986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0237-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,17]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["237"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0237-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,17]]}}}