Semidefinite relaxations for integer programming
From MaRDI portal
Recommendations
- Semidefinite programming and integer programming
- Combining semidefinite and polyhedral relaxations for integer programs
- Semidefinite programming and combinatorial optimization
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
Cited in
(26)- On Integrality in Semidefinite Programming for Discrete Optimization
- A framework for solving mixed-integer semidefinite programs
- Lifting and separation procedures for the cut polytope
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- Semidefinite programming relaxations for linear semi-infinite polynomial programming
- Relaxations of the satisfiability problem using semidefinite programming
- A guide to conic optimisation and its applications
- The demand weighted vehicle routing problem
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Recent advances in integer programming
- Matrix relaxations in combinatorial optimization
- Semidefinite relaxations of dynamical programs under discrete constraints
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- A semidefinite programming approach for solving multiobjective linear programming
- Semidefinite programming based approaches to the break minimization problem
- scientific article; zbMATH DE number 3900505 (Why is no real title available?)
- Standard pairs and group relaxations in integer programming
- Combining semidefinite and polyhedral relaxations for integer programs
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- Exploiting semidefinite relaxations in constraint programming
- Integer sequences and semidefinite programming
- Immediate schedule adjustment and semidefinite relaxation
This page was built for publication: Semidefinite relaxations for integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565247)
