The sport teams grouping problem
From MaRDI portal
Publication:1730756
DOI10.1007/s10479-017-2595-zzbMath1411.90302OpenAlexW2740739372MaRDI QIDQ1730756
Jan Christiaens, Túlio A. M. Toffolo, Frits C. R. Spieksma, Greet vanden Berghe
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/7c27f75f-fb0f-44c7-97ce-b0fd4818247f
integer programmingcolumn generationbranch-and-pricemeta-heuristicdecomposition strategiessport teams grouping problem
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (5)
Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ Multi-league sports scheduling with different leagues sizes ⋮ Optimization of team selection in fantasy cricket: a hybrid approach using recursive feature elimination and genetic algorithm ⋮ The multi-league sports scheduling problem, or how to schedule thousands of matches ⋮ Handling fairness issues in time-relaxed tournaments with availability constraints
Cites Work
- Unnamed Item
- Two exact algorithms for the traveling umpire problem
- Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
- Edge coloring: a natural model for sports scheduling
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables
- Size-constrained graph partitioning polytopes
- Round robin tournaments and three index assignments
- Scheduling in sports: an annotated bibliography
- A simulated annealing approach to the traveling tournament problem
- Scheduling non-professional table-tennis leagues
- Cliques and clustering: A combinatorial approach
- Memetic algorithm timetabling for non-commercial sport leagues.
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- Branching rules revisited
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- Decomposition Principle for Linear Programs
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
- Sports scheduling: Problems and applications
- Selected Topics in Column Generation
This page was built for publication: The sport teams grouping problem