{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:38:50Z","timestamp":1725910730341},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319674674"},{"type":"electronic","value":"9783319674681"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67468-1_8","type":"book-chapter","created":{"date-parts":[[2017,9,14]],"date-time":"2017-09-14T15:30:39Z","timestamp":1505403039000},"page":"106-118","source":"Crossref","is-referenced-by-count":0,"title":["Solving the Travelling Umpire Problem with Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Joost","family":"Vennekens","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,15]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-40564-8_5","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., Calimeri, F., Charwat, G., Dao-Tran, M., Dodaro, C., Ianni, G., Krennwallner, T., Kronegger, M., Oetsch, J., Pfandler, A., P\u00fchrer, J., Redl, C., Ricca, F., Schneider, P., Schwengerer, M., Spendier, L.K., Wallner, J.P., Xiao, G.: The fourth answer set programming competition: preliminary report. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 42\u201353. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40564-8_5"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.artint.2015.09.008","volume":"231","author":"F Calimeri","year":"2016","unstructured":"Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the fifth answer set programming competition. Artif. Intell. 231, 151\u2013181 (2016)","journal-title":"Artif. Intell."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-20895-9_46","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"F Calimeri","year":"2011","unstructured":"Calimeri, F., et al.: The third answer set programming competition: preliminary report of the system competition track. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 388\u2013403. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-20895-9_46"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2013.12.019","volume":"2","author":"L Oliveira de","year":"2014","unstructured":"de Oliveira, L., de Souza, C., Yunes, T.: Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic. EJOR 2, 592\u2013600 (2014)","journal-title":"EJOR"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.tcs.2014.09.037","volume":"562","author":"L Oliveira de","year":"2015","unstructured":"de Oliveira, L., de Souza, C., Yunes, T.: On the complexity of the traveling umpire problem. Theor. Comput. Sci. 562, 101\u2013111 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczy\u0144ski, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637\u2013654. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04238-6_75"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., Schaub, T.: Abstract gringo. In: TPLP (2015)","DOI":"10.1017\/S1471068415000150"},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the potsdam answer set solving collection. AI Communications 24(2), 107\u2013124 (2011)","journal-title":"AI Communications"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","volume-title":"Logic Programming and Nonmonotonic Reasoning","year":"2007","unstructured":"Baral, C., Brewka, G., Schlipf, J. (eds.): LPNMR 2007. LNCS (LNAI), vol. 4483. Springer, Heidelberg (2007)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-23264-5_44","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2015","unstructured":"Gebser, M., Maratea, M., Ricca, F.: The design of the sixth answer set programming competition. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS, vol. 9345, pp. 531\u2013544. Springer, Cham (2015). doi: 10.1007\/978-3-319-23264-5_44"},{"key":"8_CR11","first-page":"1070","volume-title":"ICLP","author":"M Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) ICLP, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25566-3_40"},{"key":"8_CR13","volume-title":"Branch-and-Price and Improved Bounds to the Traveling Umpire Problem","author":"T Toffolo","year":"2014","unstructured":"Toffolo, T., Van Malderen, S., Wauters, T.V., Berghe, G.: Branch-and-Price and Improved Bounds to the Traveling Umpire Problem. PATAT, York (2014)"},{"key":"8_CR14","first-page":"932","volume":"3","author":"T Toffolo","year":"2015","unstructured":"Toffolo, T., Wauters, T., Van Malderen, S., Vanden Berghe, G.: Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem. EJOR 3, 932\u2013943 (2015)","journal-title":"EJOR"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-72397-4_24","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"MA Trick","year":"2007","unstructured":"Trick, M.A., Yildiz, H.: Bender\u2018s cuts guided large neighborhood search for the traveling umpire problem. In: Van Hentenryck, P., Wolsey, L. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 332\u2013345. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72397-4_24"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1002\/nav.20482","volume":"8","author":"M Trick","year":"2011","unstructured":"Trick, M., Yildiz, H.: Benders\u2019 cuts guided large neighborhood search for the traveling umpire problem. Naval Res. Logistics (NRL) 8, 771\u2013781 (2011)","journal-title":"Naval Res. Logistics (NRL)"},{"key":"8_CR17","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.ejor.2011.07.049","volume":"2","author":"M Trick","year":"2012","unstructured":"Trick, M., Yildiz, H.: Locally optimized crossover for the traveling umpire problem. EJOR 2, 286\u2013292 (2012)","journal-title":"EJOR"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/inte.1100.0514","volume":"3","author":"M Trick","year":"2012","unstructured":"Trick, M., Yildiz, H., Yunes, T.: Scheduling major league baseball umpires and the traveling umpire problem. Interfaces 3, 232\u2013244 (2012)","journal-title":"Interfaces"},{"key":"8_CR19","unstructured":"Wauters, T.: http:\/\/benchmark.gent.cs.kuleuven.be\/tup\/ Accessed 27 Oct 2016"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1016\/j.ejor.2014.04.043","volume":"3","author":"T Wauters","year":"2014","unstructured":"Wauters, T., Van Malderen, S., Vanden Berghe, G.: Decomposition and local search based methods for the traveling umpire problem. EJOR 3, 886\u2013898 (2014)","journal-title":"EJOR"},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1016\/j.ejor.2014.12.038","volume":"3","author":"L Xue","year":"2015","unstructured":"Xue, L., Luo, Z., Lim, A.: Two exact algorithms for the traveling umpire problem. EJOR 3, 932\u2013943 (2015)","journal-title":"EJOR"}],"container-title":["Communications in Computer and Information Science","BNAIC 2016: Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67468-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T17:34:41Z","timestamp":1602956081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67468-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319674674","9783319674681"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67468-1_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}