Pages that link to "Item:Q2583777"
From MaRDI portal
The following pages link to Semidefinite programming based approaches to the break minimization problem (Q2583777):
Displaying 17 items.
- Breaks, cuts, and patterns (Q408430) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- The timetable constrained distance minimization problem (Q846138) (← links)
- A Benders approach for the constrained minimum break problem (Q856212) (← links)
- Minimizing breaks by maximizing cuts. (Q1400343) (← links)
- On the separation in 2-period double round robin tournaments with minimum breaks (Q1762158) (← links)
- A polynomial-time algorithm to find an equitable home--away assignment (Q1779696) (← links)
- Integrated break and carryover effect minimization (Q2093191) (← links)
- Round robin scheduling -- a survey (Q2475809) (← links)
- Scheduling the professional soccer leagues of Austria and Germany (Q2583771) (← links)
- A variable neighborhood search method for solving the traveling tournaments problem (Q2631249) (← links)
- Minimization of the number of breaks in sports scheduling problems using constraint programming (Q2751584) (← links)
- On the generalized mirrored scheme for double round robin tournaments in sports scheduling (Q2846487) (← links)
- Sports scheduling: Problems and applications (Q4918255) (← links)
- Algorithmic Applications in Management (Q5710104) (← links)
