{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:16:57Z","timestamp":1772893017017,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343066","type":"print"},{"value":"9783540343073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11757375_15","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T07:59:15Z","timestamp":1148025555000},"page":"167-181","source":"Crossref","is-referenced-by-count":14,"title":["The Timetable Constrained Distance Minimization Problem"],"prefix":"10.1007","author":[{"given":"Rasmus V.","family":"Rasmussen","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Trick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Operations Research\u00a046(3), 316\u2013329 (1998)","journal-title":"Operations Research"},{"issue":"7","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1016\/j.cor.2004.09.025","volume":"33","author":"F.D. Croce","year":"2006","unstructured":"Croce, F.D., Oliveri, D.: Scheduling the Italian football league: An ILP-based approach. Computers & Operations Research\u00a033(7), 1963\u20131974 (2006)","journal-title":"Computers & Operations Research"},{"key":"15_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":"15_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 traveling 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":"15_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-6377(03)00025-7","volume":"31","author":"M. Elf","year":"2003","unstructured":"Elf, M., J\u00fcnger, M., Rinaldi, G.: Minimizing breaks by maximizing cuts. Operations Research Letters\u00a031, 343\u2013349 (2003)","journal-title":"Operations Research Letters"},{"key":"15_CR6","first-page":"545","volume-title":"Proceedings of the International Conference on Logic Programming","author":"M. Henz","year":"1999","unstructured":"Henz, M.: Constraint-based round robin tournament planning. In: De Schreye, D. (ed.) Proceedings of the International Conference on Logic Programming, Las Cruces, New Mexico, pp. 545\u2013557. MIT Press, Cambridge (1999)"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/opre.49.1.163.11193","volume":"49","author":"M. Henz","year":"2001","unstructured":"Henz, M.: Scheduling a major college basketball conference - revisited. Operations Research\u00a049, 163\u2013168 (2001)","journal-title":"Operations Research"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/S0377-2217(03)00101-2","volume":"153","author":"M. Henz","year":"2004","unstructured":"Henz, M., M\u00fcller, T., Thiel, S.: Global constraints for round robin tournament scheduling. European Journal of Operational Research\u00a0153(1), 92\u2013101 (2004)","journal-title":"European Journal of Operational Research"},{"key":"15_CR9","unstructured":"ILOG, ILOG OPL Studio 3.7, Language Manual (2003)"},{"issue":"7","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1975","DOI":"10.1016\/j.cor.2004.09.030","volume":"33","author":"R. Miyashiro","year":"2006","unstructured":"Miyashiro, R., Matsui, T.: Semidefinite programming based approaches to the break minimization problem. Computers & Operations Research\u00a033(7), 1975\u20131982 (2006)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"G.L. Nemhauser","year":"1998","unstructured":"Nemhauser, G.L., Trick, M.A.: Scheduling a Major College Basketball Conference. Operations Research\u00a046(1), 1\u20138 (1998)","journal-title":"Operations Research"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Rasmussen, R.V., Trick, M.A.: A Benders approach for the constrained minimum break problem. European Journal of Operational Research (to appear)","DOI":"10.1016\/j.ejor.2005.10.063"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.C.: Minimization of the number of breaks in sports scheduling problems using constraint programming, Constraint programming and large scale discrete optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a057, pp. 115\u2013130 (2001)","DOI":"10.1090\/dimacs\/057\/07"},{"issue":"4","key":"15_CR14","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(4), 614\u2013625 (1994)","journal-title":"Operations Research"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1009845710839","volume":"4","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A.: Scheduling Sport Tournaments using Constraint Logic Programming. Constraints\u00a04, 43\u201365 (1999)","journal-title":"Constraints"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-44629-X_15","volume-title":"Practice and Theory of Automated Timetabling III","author":"M.A. Trick","year":"2001","unstructured":"Trick, M.A.: A Schedule-Then-Break Approach to Sports Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 242\u2013253. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11757375_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:10Z","timestamp":1619507050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11757375_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343066","9783540343073"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11757375_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}