{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:14:55Z","timestamp":1761894895662,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019289"},{"type":"electronic","value":"9783642019296"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01929-6_21","type":"book-chapter","created":{"date-parts":[[2009,5,16]],"date-time":"2009-05-16T09:09:16Z","timestamp":1242464956000},"page":"279-293","source":"Crossref","is-referenced-by-count":14,"title":["DFS* and the Traveling Tournament Problem"],"prefix":"10.1007","author":[{"given":"David C.","family":"Uthus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patricia J.","family":"Riddle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans W.","family":"Guesgen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Benoist, T., Laburthe, F., Rottembourg, B.: Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In: Proceedings of CP-AI-OR 2001, Wye College, UK, pp. 15\u201326 (2001)"},{"key":"21_CR2","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers, San Francisco (2003)"},{"key":"21_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\u2013584. Springer, Heidelberg (2001)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, K., Nemhauser, G., Trick, M.: Solving the travelling tournament problem: A combined integer programming and constraint programming approach. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 100\u2013109. Springer, Heidelberg (2003)"},{"key":"21_CR5","unstructured":"Irnich, S., Schrempp, U.: A new branch-and-price algorithm for the traveling tournament problem. Presented at Column Generation 2008, Aussois, France (June 17-20, 2008), \n                      http:\/\/www.gerad.ca\/colloques\/ColumnGeneration2008\/slides\/SIrnich.pdf\n                     (accessed March 07, 2009)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0004-3702(91)90100-X","volume":"50","author":"U.K. Sarkar","year":"1991","unstructured":"Sarkar, U.K., Chakrabarti, P.P., Ghose, S., De Sarkar, S.C.: Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Artificial Intelligence\u00a050, 207\u2013221 (1991)","journal-title":"Artificial Intelligence"},{"key":"21_CR7","unstructured":"Trick, M.: Challenge Traveling Tournament Problems, \n                      http:\/\/mat.gsia.cmu.edu\/TOURN\/\n                     (accessed March 07, 2009)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Urrutia, S., Ribeiro, C.C., Melo, R.A.: A new lower bound to the traveling tournament problem. In: IEEE Symposium on Computational Intelligence in Scheduling, pp. 15\u201318 (2007)","DOI":"10.1109\/SCIS.2007.367664"},{"key":"21_CR9","unstructured":"Vempaty, N.R., Kumar, V., Korf, R.E.: Depth-First vs Best-First Search. In: Proc. National Conf. on Artificial Intelligence, AAAI 1991, Anaheim, CA, pp. 434\u2013440 (1991)"},{"key":"21_CR10","unstructured":"Wah, B.W.: MIDA*: An IDA* search with dynamic control. Technical report, Coordinated Science Laboratoy, University of Illinois, Urbana, Illinois (1991)"},{"key":"21_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/0470053925","volume-title":"Parallel Combinatorial Optimization","author":"E.-G. Talbi","year":"2006","unstructured":"Talbi, E.-G.: Parallel Combinatorial Optimization. John Wiley & Sons, Hoboken (2006)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01929-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T23:03:41Z","timestamp":1609196621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01929-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019289","9783642019296"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01929-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}