Semidefinite programming based approaches to the break minimization problem
From MaRDI portal
Publication:2583777
DOI10.1016/j.cor.2004.09.030zbMath1090.90154OpenAlexW2078281801MaRDI QIDQ2583777
Tomomi Matsui, Ryuhei Miyashiro
Publication date: 18 January 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.09.030
Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
A variable neighborhood search method for solving the traveling tournaments problem ⋮ The timetable constrained distance minimization problem ⋮ A Benders approach for the constrained minimum break problem ⋮ Round robin scheduling -- a survey ⋮ Sports scheduling: Problems and applications ⋮ Efficient branch-and-bound algorithms for weighted MAX-2-SAT ⋮ On the separation in 2-period double round robin tournaments with minimum breaks ⋮ On the application of graph colouring techniques in round-robin sports scheduling ⋮ A polynomial-time algorithm to find an equitable home--away assignment ⋮ A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem ⋮ ON THE GENERALIZED MIRRORED SCHEME FOR DOUBLE ROUND ROBIN TOURNAMENTS IN SPORTS SCHEDULING ⋮ Integrated break and carryover effect minimization ⋮ Scheduling the professional soccer leagues of Austria and Germany
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing breaks by maximizing cuts.
- A polynomial-time algorithm to find an equitable home--away assignment
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
This page was built for publication: Semidefinite programming based approaches to the break minimization problem
