References
- AnagnostopoulosAMichelLvan HentenryckPVergadosYA simulated annealing approach to the travelling tournament problemJ Scheduling2006917719310.1007/s10951-006-7187-8
- BarnhartCJohnsonELNemhauserGLSavelsberghMWPVancePHBranch-and-price: Column generation for solving huge integer programsOpns Res19964631632910.1287/opre.46.3.316
- BartschTSportligaplanung – Ein Decision Support System zur Spielplanerstellung2001
- BartschTDrexlAKrögerSScheduling the professional soccer leagues of Austria and GermanyComput Opns Res2006331907193710.1016/j.cor.2004.09.037
- BriskornDDrexlAScheduling sports leagues using branch-and-priceProceedings of the Sixth International Conference on the Practice and Theory of Automated Timetabling2006367369
- BriskornDDrexlAGOR Proceedings 20062007
- Briskorn D, Drexl A and Spieksma FCR (2006). Round robin tournaments and three index assignment. Working Paper.
- BruckerPKnustSComplex Scheduling2006
- CookWRoheAComputing minimum-weight perfect matchingsINFORMS J Comput19991113814810.1287/ijoc.11.2.138
- de WerraDGeography, games and graphsDiscrete Appl Math1980232733710.1016/0166-218X(80)90028-1
- de WerraDScheduling in sportsStudies on Graphs and Discrete Programming1981381395
- de WerraDMinimizing irregularities in sports schedules using graph theoryDiscrete Appl Math1982421722610.1016/0166-218X(82)90042-7
- de WerraDOn the multiplication of divisions: The use of graphs for sports schedulingNetworks19851512513610.1002/net.3230150110
- de WerraDSome models of graphs for scheduling sports competitionsDiscrete Appl Math198521476510.1016/0166-218X(88)90033-9
- de WerraDEkimTRaessCConstruction of sports schedules with multiple venuesDiscrete Appl Math2006154475810.1016/j.dam.2005.03.011
- DrexlAKnustSSports league scheduling: graph- and resource-based modelsOmega20073546547110.1016/j.omega.2005.08.002
- EastonKNemhauserGTrickMThe travelling tournament problem: Description and benchmarksProceedings of Principles and Practice of Constraint Programming – CP 20012001580585
- EdmondsJMaximum matching and a polyhedron with (0,1) verticesJ Res Natl Bureau Standards Sect B196569B12513010.6028/jres.069B.013
- GilmorePCGomoryREA linear programming approach to the cutting-stock problemOpns Res1961984985910.1287/opre.9.6.849
- Kendall G (2007). Scheduling English football fixtures over holiday periods. J Opl Res Soc., Advance online publication, (doi: 10.1057/palgrave.jors.2602382).
- KirkmanTPOn a problem in combinationsCambridge Dublin Math J18472191204
- KuhnHWThe Hungarian method for the assignment problemNaval Res Logistics Quart19552839710.1002/nav.3800020109
- LasdonLSOptimization theory for large systems1970
- Lowerre BT (1976). The HARPY speech recognition system. Ph.D thesis, Carnegie-Mellon University, USA.
- MehrotraATrickMAA column generation approach for graph coloringINFORMS J Comput1996834435410.1287/ijoc.8.4.344
- MiyashiroRIwasakiHMatsuiTCharacterizing feasible pattern sets with a minimum number of breaksProceedings of the Fourth International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science20037899
- Rasmussen RV (2008). Scheduling a triple round robin tournament for the best Danish soccer league. Eur J Opl Res 185, 795–810.
- RasmussenRVTrickMAA benders approach for the constrained minimum break problemEur J Opl Res200717719821310.1016/j.ejor.2005.10.063
- Rubin S (1978). The ARGOS image understanding system. Ph.D thesis, Carnegie-Mellon University, USA.
- RyanDMFosterBAAn integer programming approach to schedulingComputer scheduling of public transport. urban passenger vehicle and crew scheduling1981269280
- SchreuderJAMConstructing timetables for sport competitionsMath Programming Study198013586710.1007/BFb0120907
- SchreuderJAMCombinatorial aspects of construction of competition dutch professional football leaguesDiscrete Appl Math19923530131210.1016/0166-218X(92)90252-6
- UrrutiaSRibeiroCCMinimizing travels by maximizing breaks in round robin tournament schedulesElectronic Notes Discrete Math200418C22723110.1016/j.endm.2004.06.036
- VancePHBarnhartCJohnsonELNemhauserGLSolving binary cutting stock problems by column generation and branch-and-boundComput Optim Appl1994311113010.1007/BF01300970