Ap-cone sequential relaxation procedure for 0-1 integer programs

DOI10.1080/10556780903057341zbMATH Open1192.90124OpenAlexW2169525491MaRDI QIDQ3396384FDOQ3396384

Authors: Samuel Burer, Jieqiu Chen 

Publication date: 18 September 2009

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780903057341

Recommendations

• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• Combining semidefinite and polyhedral relaxations for integer programs
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

zbMATH Keywords

global optimizationconvex relaxationsecond-order cone programmingcone programming\(0-1\) integer programmingsuccessive convex relaxations

Mathematics Subject Classification ID

Boolean programming (90C09)

Cited In (5)

• Variational analysis of norm cones in finite dimensional Euclidean spaces
• Risk optimization with \(p\)-order conic constraints: a linear programming approach
• Global optimization
• Strengthening convex relaxations of 0/1-sets using Boolean formulas
• Geometric proofs for convex hull defining formulations

Uses Software

• MIPLIB2003
• DIMACS

This page was built for publication: Ap-cone sequential relaxation procedure for 0-1 integer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396384)