{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:41:55Z","timestamp":1725514915408},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_24","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T15:56:32Z","timestamp":1182527792000},"page":"332-345","source":"Crossref","is-referenced-by-count":8,"title":["Bender\u2019s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Trick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hakan","family":"Yildiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Challenge Traveling Tournament Instances (January 2007), \n                  \n                    http:\/\/mat.gsia.cmu.edu\/TOURN\/"},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1287\/opre.48.4.623.12420","volume":"48","author":"M.W. Dawande","year":"2000","unstructured":"Dawande, M.W., Hooker, J.N.: Inference-Based Sensitivity Analysis for Mixed Integer\/Linear Programming. Operations Research\u00a048(4), 623\u2013634 (2000)","journal-title":"Operations Research"},{"key":"24_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.L., Trick, M.A.: The Traveling Tournament Problem: Description and Benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 580\u2013585. Springer, Heidelberg (2001)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/S0098-1354(02)00100-X","volume":"26","author":"I. Harjunkoski","year":"2002","unstructured":"Harjunkoski, I., Grossmann, I.E.: Decomposition Techniques for Multistage Scheduling Problems Using Mixed-integer and Constraint Programming Methods. Computers and Chemical Engineering\u00a026, 1533\u20131552 (2002)","journal-title":"Computers and Chemical Engineering"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Hooker, J.N.: Planning and Scheduling by Logic-based Benders Decomposition. Operations Research (to appear)","DOI":"10.1287\/opre.1060.0371"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Mathematical Programming\u00a096, 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"key":"24_CR7","unstructured":"ILOG Inc., ILOG OPL Studio 3.7 Language Manual (2003)"},{"issue":"4","key":"24_CR8","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP-CP models for a class of optimization problems. INFORMS Journal on Computing\u00a013(4), 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ejor.2005.10.063","volume":"177","author":"R.V. Rasmussen","year":"2007","unstructured":"Rasmussen, R.V., Trick, M.A.: A Benders approach for the constrained minimum break problem. European Journal of Operational Research\u00a0177, 198\u2013213 (2007)","journal-title":"European Journal of Operational Research"},{"key":"24_CR10","unstructured":"Traveling Umpire Problem (January 2007), \n                  \n                    http:\/\/www.andrew.cmu.edu\/user\/hakanyil\/TUP\/"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/978-3-540-45157-0_4","volume-title":"Practice and Theory of Automated Timetabling IV","author":"M.A. Trick","year":"2003","unstructured":"Trick, M.A.: Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 63\u201377. Springer, Heidelberg (2003)"},{"key":"24_CR12","unstructured":"Yildiz, H., Trick, M.: The Traveling Umpire Problem. Invited Talk. In: Informs Annual Conference, Pittsburgh, PA (November 2006)"}],"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\/978-3-540-72397-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T07:00:57Z","timestamp":1550386857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}