Semidefinite programming based approaches to the break minimization problem
From MaRDI portal
Publication:2583777
DOI10.1016/J.COR.2004.09.030zbMATH Open1090.90154OpenAlexW2078281801MaRDI QIDQ2583777FDOQ2583777
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
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
Approximation methods and heuristics in mathematical programming (90C59) Semidefinite programming (90C22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT
- Title not available (Why is that?)
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Minimizing breaks by maximizing cuts.
- A polynomial-time algorithm to find an equitable home--away assignment
- Minimization of the number of breaks in sports scheduling problems using constraint programming
Cited In (18)
- Round robin scheduling -- a survey
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Scheduling the professional soccer leagues of Austria and Germany
- On the application of graph colouring techniques in round-robin sports scheduling
- The timetable constrained distance minimization problem
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- 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
- Algorithmic Applications in Management
- Sports scheduling: problems and applications
- Breaks, cuts, and patterns
- The home-away assignment problems and break minimization/maximization problems in sports scheduling
- Minimization of the number of breaks in sports scheduling problems using constraint programming
- A Benders approach for the constrained minimum break problem
- A variable neighborhood search method for solving the traveling tournaments problem
- On the generalized mirrored scheme for double round robin tournaments in sports scheduling
- Integrated break and carryover effect minimization
Uses Software
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)
