{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:39:14Z","timestamp":1725493154819},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766308"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76631-5_9","type":"book-chapter","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T02:33:07Z","timestamp":1193020387000},"page":"83-93","source":"Crossref","is-referenced-by-count":6,"title":["Clustering Search Approach for the Traveling Tournament Problem"],"prefix":"10.1007","author":[{"given":"Fabr\u00edcio Lacerda","family":"Biajoli","sequence":"first","affiliation":[]},{"given":"Luiz Antonio Nogueira","family":"Lorena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A Simulated Annealing Approach to the Traveling Tournament Problem. In: Proceedings of Cpaior 2003 (2003)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","first-page":"433","volume-title":"Patat2004","author":"F.L. Biajoli","year":"2005","unstructured":"Biajoli, F.L., Chaves, A.A., Mine, O.M., Souza, M.J.F., Pontes, R.C., Lucena, A., Cabral, L.F.: Scheduling the Brazilian Soccer Championship: A Simulated Annealing Approach. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 433\u2013437. Springer, Heidelberg (2005)"},{"key":"9_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11874850_25","volume-title":"Advances in Artificial Intelligence - IBERAMIA-SBIA 2006","author":"F.L. Biajoli","year":"2006","unstructured":"Biajoli, F.L., Lorena, L.A.N.: Mirrored Traveling Tournament Problem: An Evolutionary Approach. In: Sichman, J.S., Coelho, H., Rezende, S.O. (eds.) IBERAMIA 2006 and SBIA 2006. LNCS (LNAI), vol.\u00a04140, pp. 208\u2013217. Springer, Heidelberg (2006)"},{"issue":"2","key":"9_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1590\/S0103-17592002000200003","volume":"13","author":"R. Conc\u00edlio","year":"2002","unstructured":"Conc\u00edlio, R., Zuben, F.J.: Uma Abordagem Evolutiva para Gera\u00e7\u00e3o Autom\u00e1tica de Turnos Completos em Torneios. Revista Controle e Automa\u00e7\u00e3o\u00a013(2), 105\u2013122 (2002)","journal-title":"Revista Controle e Automa\u00e7\u00e3o"},{"issue":"3","key":"9_CR5","first-page":"161","volume":"33","author":"D. Costa","year":"1995","unstructured":"Costa, D.: An Evolutionary Tabu Search Algorithm and the NHL Scheduling Problem. Infor.\u00a033(3), 161\u2013178 (1995)","journal-title":"Infor."},{"key":"9_CR6","first-page":"578","volume-title":"Handbook of Combinatorial Designs","author":"J. Dinitz","year":"1995","unstructured":"Dinitz, J., Lamken, E., Wallis, W.D.: Scheduling a Tournament. In: Colbourn, C.J., Dinitz, J. (eds.) Handbook of Combinatorial Designs, pp. 578\u2013584. CRC Press, Boca Raton, USA (1995)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Easton, K., Nemhauser, G., Trick, M.: The Traveling Tournament Problem Description and Benchmarks. In: CP 1999, pp. 580\u2013589 (2001)","DOI":"10.1007\/3-540-45578-7_43"},{"key":"9_CR8","first-page":"175","volume-title":"Interfaces in Computer Science and Operations Research. [S.l.]","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu search and adaptive memory programing: Advances, applications and challenges. In: Interfaces in Computer Science and Operations Research. [S.l.], p. 175. Kluwer, Dordrecht (1996)"},{"key":"9_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45612-0_2","volume-title":"Local Search for Planning and Scheduling","author":"J.P. Hamiez","year":"2001","unstructured":"Hamiez, J.P., Hao, J.K.: Solving The Sports League Scheduling Problem with Tabu Search. In: Nareyek, A. (ed.) Local Search for Planning and Scheduling. LNCS (LNAI), vol.\u00a02148, pp. 24\u201336. Springer, Heidelberg (2001)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/11757375_19","volume-title":"CPAIOR 2006","author":"P.V. Hentenryck","year":"2006","unstructured":"Hentenryck, P.V., Vergados, Y.: Traveling tournament scheduling: A systematic evaluation of simulated annealling. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol.\u00a03990, pp. 228\u2013243. Springer, Heidelberg (2006)"},{"key":"9_CR11","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Loureno","year":"2002","unstructured":"Loureno, H.R., Martin, O., Sttzle, T.: Iterated local search. In: Handbook of Metaheuristics, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2002)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"G. Nemhauser","year":"1998","unstructured":"Nemhauser, G., Trick, M.: Scheduling a Major College Basketball Conference. Operations Research\u00a046(1), 1\u20138 (1998)","journal-title":"Operations Research"},{"key":"9_CR14","unstructured":"Oliveira, A.C.M.: Algoritmos Evolutivos Hbridos com Deteco de Regies Promissoras em Espaos de Busca Contnuo e Discreto. 200 p. Tese (Doutorado) Instituto Nacional de Pesquisa Operacional (INPE), So Jos dos Campos - SP (2004)"},{"key":"9_CR15","series-title":"Lecture Notes in Artificial Intelligence Series","first-page":"218","volume-title":"Pattern sequencing problems by clustering search","author":"A.C.M. Oliveira","year":"2006","unstructured":"Oliveira, A.C.M., Lorena, L.A.N.: Pattern sequencing problems by clustering search. Lecture Notes in Artificial Intelligence Series, vol.\u00a04140, pp. 218\u2013227. Springer, Heidelberg (2006)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","first-page":"323","volume-title":"Patat2004","author":"C.C. Ribeiro","year":"2005","unstructured":"Ribeiro, C.C., Urrutia, S.: Heuristics for the Mirrored Traveling Tournament Problem. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 323\u2013342. Springer, Heidelberg (2005)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/S0377-2217(03)00102-4","volume":"153","author":"J. Sch\u00f6nberger","year":"1989","unstructured":"Sch\u00f6nberger, J., Mattfeld, D.C., Kopfer, H.: Memetic Algorithm Timetabling for Non-Commercial Sport Leagues. European Journal of Operational Research\u00a0153(1), 102\u2013116 (1989)","journal-title":"European Journal of Operational Research"},{"key":"9_CR18","unstructured":"Zhang, H.: Generating College Conference Basketball Schedules by a Sat Solver. In: Proceedings Of The Fifth International Symposium on the Theory and Applications of Satisfiability Testing, Cincinnati, pp. 281\u2013291 (2002)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2007: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76631-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:56:14Z","timestamp":1619520974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76631-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766308"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76631-5_9","relation":{},"subject":[]}}