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

DOI10.1080/10556780903057341MaRDI QIDQ3396384zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(0-1\) integer programmingcone programmingconvex relaxationglobal optimizationsecond-order cone programmingsuccessive convex relaxations

Mathematics Subject Classification ID

Boolean programming (90C09)

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

Cited in

(6)

• Risk optimization with p-order conic constraints: a linear programming approach
• Geometric proofs for convex hull defining formulations
• Strengthening convex relaxations of 0/1-sets using Boolean formulas
• Global optimization
• Variational analysis of norm cones in finite dimensional Euclidean spaces
• On the structure and computation of extremal mediated graphs with applications to conic optimization

Describes a project that uses

Uses Software

• DIMACS
• MIPLIB2003

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)