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