{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:11:06Z","timestamp":1760645466575},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540773443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77345-0_11","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T05:53:06Z","timestamp":1195883586000},"page":"158-173","source":"Crossref","is-referenced-by-count":25,"title":["Referee Assignment in Sports Leagues"],"prefix":"10.1007","author":[{"given":"Alexandre R.","family":"Duarte","sequence":"first","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]},{"given":"Sebasti\u00e1n","family":"Urrutia","sequence":"additional","affiliation":[]},{"given":"Edward H.","family":"Haeusler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","volume":"9","author":"A. Anagnostopoulos","year":"2006","unstructured":"Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. Journal of Scheduling\u00a09, 177\u2013193 (2006)","journal-title":"Journal of Scheduling"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)00057-4","volume":"148","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems \u2013 Part I. Theoretical Computer Science\u00a0148, 93\u2013109 (1995)","journal-title":"Theoretical Computer Science"},{"key":"11_CR3","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175\u2013180. SIAM, Philadelphia (1998)"},{"key":"11_CR4","first-page":"22","volume":"44","author":"J.H. Dinitz","year":"2005","unstructured":"Dinitz, J.H., Stinson, D.R.: On assigning referees to tournament schedules. Bulletin of the Institute of Combinatorics and its Applications\u00a044, 22\u201328 (2005)","journal-title":"Bulletin of the Institute of Combinatorics and its Applications"},{"key":"11_CR5","unstructured":"Duarte, A.R.: Challenge referee assignment problem instances (last visited on March 23, 2007), Online document at \n                    \n                      http:\/\/www.esportemax.org\/rapopt"},{"key":"11_CR6","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.: The traveling tournament problem: Description and benchmarks. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 580\u2013584. Springer, Heidelberg (2001)"},{"key":"11_CR7","unstructured":"Easton, K., Nemhauser, G.L., Trick, M.: Sports scheduling. In: Leung, J.T. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis, pp. 52.1\u201352.19. CRC Press, Boca Raton, FL (2004)"},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/inte.18.6.42","volume":"18","author":"J.R. Evans","year":"1988","unstructured":"Evans, J.R.: A microcomputer-based decision support system for scheduling umpires in the American baseball league. Interfaces\u00a018, 42\u201351 (1988)","journal-title":"Interfaces"},{"key":"11_CR9","first-page":"18","volume":"4","author":"J.R. Evans","year":"1984","unstructured":"Evans, J.R., Hebert, J.E., Deckro, R.F.: Play ball \u2013 The scheduling of sports officials. Perspectives in Computing\u00a04, 18\u201329 (1984)","journal-title":"Perspectives in Computing"},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"M.L. Fisher","year":"1986","unstructured":"Fisher, M.L., Jaikumar, R., Van Wassenhove, L.N.: A multiplier adjustment method for the generalized assignment problem. Management Science\u00a032, 1095\u20131103 (1986)","journal-title":"Management Science"},{"key":"11_CR11","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.P. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.P., Martin, O., St\u00fctzle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321\u2013353. Kluwer, Dordrecht (2003)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02601639","volume":"63","author":"O. Martin","year":"1996","unstructured":"Martin, O., Otto, S.W.: Combining simulated annealing with local search heuristics. Annals of Operations Research\u00a063, 57\u201375 (1996)","journal-title":"Annals of Operations Research"},{"key":"11_CR13","first-page":"299","volume":"5","author":"O. Martin","year":"1991","unstructured":"Martin, O., Otto, S.W., Felten, E.W.: Large-step Markov chains for the traveling salesman problem. Complex Systems\u00a05, 299\u2013326 (1991)","journal-title":"Complex Systems"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"G.L. Nemhauser","year":"1997","unstructured":"Nemhauser, G.L., Trick, M.A.: Scheduling a major college basketball conference. Operations Research\u00a046, 1\u20138 (1997)","journal-title":"Operations Research"},{"key":"11_CR15","unstructured":"Rasmussen, R.V., Trick, M.A.: Round robin scheduling \u2013 A survey. Technical Report, Department of Operations Research, University of Aarhus (2006)"},{"key":"11_CR16","first-page":"50","volume":"31","author":"C.C. Ribeiro","year":"2004","unstructured":"Ribeiro, C.C., Urrutia, S.: OR on the ball: Applications in sports scheduling and management. OR\/MS Today\u00a031, 50\u201354 (2004)","journal-title":"OR\/MS Today"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1111\/j.1475-3995.2005.00513.x","volume":"12","author":"C.C. Ribeiro","year":"2005","unstructured":"Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. International Transactions in Operational Research\u00a012, 375\u2013386 (2005)","journal-title":"International Transactions in Operational Research"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2005.03.061","volume":"179","author":"C.C. Ribeiro","year":"2007","unstructured":"Ribeiro, C.C., Urrutia, S.: Heuristics for the mirrored traveling tournament problem. European Journal of Operational Research\u00a0179, 775\u2013787 (2007)","journal-title":"European Journal of Operational Research"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1038\/sj\/jors\/0420602","volume":"42","author":"M.B. Wright","year":"1991","unstructured":"Wright, M.B.: Scheduling English cricket umpires. Journal of the Operational Research Society\u00a042, 447\u2013452 (1991)","journal-title":"Journal of the Operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77345-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:08:54Z","timestamp":1619521734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77345-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773443"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77345-0_11","relation":{},"subject":[]}}