Organization of a college baseball tournament

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


The National Collegiate Athletic Association baseball tournament involves 64 teams representing American universities and colleges in a series of win-and-advance weekend tournaments. In the first weekend, a four-team 'regional' tournament is played at a host institution. The 16 regionals are also paired a priori, with the winners of paired regionals playing in the second weekend at one of the two institutions' home sites. The eight teams remaining after the second weekend play a final tournament at a neutral location. Given a selection of 64 tournament teams and their seeding classifications, prohibited four-team groupings during the first weekend and prohibited regional pairings in the second weekend, we examine the problem of creating regionals and regional pairings in order to minimize expected team travel costs. The problem is modelled as a non-linear mixed-integer program and solved by a combinatorial cutting plane approach. We examine the performance and output of the proposed algorithm on 2006 and 2007 tournament data.

Original languageEnglish (US)
Pages (from-to)213-232
Number of pages20
JournalIMA Journal of Management Mathematics
Issue number2
StatePublished - Apr 2009
Externally publishedYes


  • Cutting planes
  • Integer programming
  • Non-linear programming
  • Sports

ASJC Scopus subject areas

  • Management Information Systems
  • Modeling and Simulation
  • Economics, Econometrics and Finance(all)
  • Strategy and Management
  • Management Science and Operations Research
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Organization of a college baseball tournament'. Together they form a unique fingerprint.

Cite this