Semidefinite Relaxations for Integer Programming
From MaRDI portal
Publication:3565247
DOI10.1007/978-3-540-68279-0_18zbMath1187.90003OpenAlexW2249693094MaRDI QIDQ3565247
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
Integer programming (90C10) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (12)
Matrix Relaxations in Combinatorial Optimization ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ Lifting and separation procedures for the cut polytope ⋮ On Integrality in Semidefinite Programming for Discrete Optimization ⋮ A guide to conic optimisation and its applications ⋮ A framework for solving mixed-integer semidefinite programs ⋮ Unnamed Item ⋮ The demand weighted vehicle routing problem ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ A semidefinite programming approach for solving multiobjective linear programming ⋮ A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems ⋮ Immediate schedule adjustment and semidefinite relaxation
This page was built for publication: Semidefinite Relaxations for Integer Programming
