Semidefinite relaxations for integer programming

DOI10.1007/978-3-540-68279-0_18zbMATH Open1187.90003OpenAlexW2249693094MaRDI QIDQ3565247FDOQ3565247

Publication date: 3 June 2010

Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_18

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

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)

Cited In (26)

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
Semidefinite programming relaxations for linear semi-infinite polynomial programming
Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
A guide to conic optimisation and its applications
Relaxations of the satisfiability problem using semidefinite programming
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
Title not available (Why is that?)
Combining semidefinite and polyhedral relaxations for integer programs
Standard pairs and group relaxations in integer programming
Title not available (Why is that?)
Exploiting semidefinite relaxations in constraint programming
Integer sequences and semidefinite programming
Immediate schedule adjustment and semidefinite relaxation
On Integrality in Semidefinite Programming for Discrete Optimization

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)