Semidefinite programming based approaches to the break minimization problem

DOI10.1016/J.COR.2004.09.030MaRDI QIDQ2583777zbMATH OpenOpenAlexFDO

Authors Ryuhei Miyashiro, Tomomi Matsui

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

zbMATH Keywords

approximation algorithmsemidefinite programmingsports timetabling

Mathematics Subject Classification ID

Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Benders approach for the constrained minimum break problem
• Revisiting the minimum breakpoint linearization problem
• Revisiting the minimum breakpoint linearization problem
• A semidefinite programming approach to the hypergraph minimum bisection problem
• Solving min-max problems and linear semi-infinite programs
• Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems
• A novel approach for solving semidefinite programs
• Semidefinite programming in combinatorial optimization
• Semidefinite relaxations for integer programming
• scientific article; zbMATH DE number 1944141

Cites work

• A polynomial-time algorithm to find an equitable home--away assignment
• scientific article; zbMATH DE number 1728542 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2086914 (Why is no real title available?)
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Minimization of the number of breaks in sports scheduling problems using constraint programming
• Minimizing breaks by maximizing cuts.
• NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT

Cited in

(18)

• Minimizing breaks by maximizing cuts.
• On the separation in 2-period double round robin tournaments with minimum breaks
• A polynomial-time algorithm to find an equitable home--away assignment
• Integrated break and carryover effect minimization
• Round robin scheduling -- a survey
• Scheduling the professional soccer leagues of Austria and Germany
• A variable neighborhood search method for solving the traveling tournaments problem
• Minimization of the number of breaks in sports scheduling problems using constraint programming
• On the generalized mirrored scheme for double round robin tournaments in sports scheduling
• Breaks, cuts, and patterns
• Sports scheduling: problems and applications
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• The home-away assignment problems and break minimization/maximization problems in sports scheduling
• Algorithmic Applications in Management
• On the application of graph colouring techniques in round-robin sports scheduling
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
• The timetable constrained distance minimization problem
• A Benders approach for the constrained minimum break problem

Describes a project that uses

Uses Software

• SDPA
• SATO
• CPLEX

This page was built for publication: Semidefinite programming based approaches to the break minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583777)