A quest for a fair schedule: the international Young Physicists' Tournament
From MaRDI portal
Publication:6102843
DOI10.1007/s10951-022-00752-8zbMath1517.90040arXiv2006.02184OpenAlexW4297206831MaRDI QIDQ6102843
Lukáš Miňo, Zsuzsanna Jankó, Ágnes Cseh, Marián Kireš, Katarína Cechlárova
Publication date: 23 June 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.02184
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Fairness in academic course timetabling
- Edge coloring: a natural model for sports scheduling
- Curriculum-based course timetabling with SAT and MaxSAT
- On the application of graph colouring techniques in round-robin sports scheduling
- IP models for round robin tournaments
- Constructing fair sports league schedules with regard to strength groups
- NP-complete scheduling problems
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Minimization of rest mismatches in round robin tournaments
- A polynomial-time algorithm to find an equitable home--away assignment
- Scheduling asynchronous round-robin tournaments
- Fair optimization of fortnightly physician schedules with flexible shifts
- Handling fairness issues in time-relaxed tournaments with availability constraints
- Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks
- Two-coloring triples such that in each color class every element is missed at least once
- Polya Urn Models
- On the Complexity of Timetable and Multicommodity Flow Problems
- On Representatives of Subsets
- This House Proves that Debating is Harder than Soccer
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: A quest for a fair schedule: the international Young Physicists' Tournament
