Semidefinite relaxations for integer programming

DOI10.1007/978-3-540-68279-0_18MaRDI QIDQ3565247zbMATH OpenOpenAlexFDO

Authors Franz Rendl

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

Mathematics Subject Classification ID

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)

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)