A polynomial-time algorithm to find an equitable home--away assignment
From MaRDI portal
Publication:1779696
DOI10.1016/j.orl.2004.06.004zbMath1177.90175WikidataQ56288391 ScholiaQ56288391MaRDI QIDQ1779696
Ryuhei Miyashiro, Tomomi Matsui
Publication date: 1 June 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.06.004
90B35: Deterministic scheduling theory in operations research
Related Items
Sports scheduling: Problems and applications, Breaks, cuts, and patterns, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, On the application of graph colouring techniques in round-robin sports scheduling, A Benders approach for the constrained minimum break problem, Balanced home-away assignments, Combinatorial properties of strength groups in round robin tournaments, On the separation in 2-period double round robin tournaments with minimum breaks, Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks, Round robin scheduling -- a survey, Maximizing breaks and bounding solutions to the mirrored traveling tournament problem, Sports tournaments, home-away assignments, and the break minimization problem, Semidefinite programming based approaches to the break minimization problem, ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING
Cites Work
- Premature sets of 1-factors or how not to schedule round robin tournaments
- Geography, games and graphs
- Minimizing irregularities in sports schedules using graph theory
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Minimizing breaks by maximizing cuts.
- Semidefinite programming based approaches to the break minimization problem
- Devising a Cost Effective Schedule for a Baseball League
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Unnamed Item
- Unnamed Item
