Symmetry-exploiting cuts for a class of mixed-0/1 second-order cone programs

DOI10.1016/J.DISOPT.2014.04.002MaRDI QIDQ2339823zbMATH OpenOpenAlexFDO

Authors Sarah Drewes, Sebastian Pokutta

Publication date 9 April 2015

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2014.04.002

zbMATH Keywords

cutting planesmixed-integer nonlinear programmingouter approximationsecond order cone programming

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Mixed integer programming (90C11) Boolean programming (90C09)

Recommendations

• Cutting-planes for weakly-coupled \(0/1\) second order cone programs
• Conic mixed-integer rounding cuts
• Cuts for Conic Mixed-Integer Programming
• Cuts for mixed 0-1 conic programming
• Mixed integer second order cone programming.

Cites work

• scientific article; zbMATH DE number 1101647 (Why is no real title available?)
• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A branch-and-cut method for 0-1 mixed convex programming
• A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
• Cuts for Conic Mixed-Integer Programming
• Cuts for mixed 0-1 conic programming
• Generalized Benders decomposition
• Integrality gaps for Sherali-Adams relaxations
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Mixed integer second order cone programming.
• Partitioning procedures for solving mixed-variables programming problems
• Second-order cone programming
• Sherali-Adams relaxations of the matching polytope
• Solving mixed integer nonlinear programs by outer approximation
• Subgradient based outer approximation for mixed integer second order cone programming

Cited in

(4)

• Cutting-planes for weakly-coupled \(0/1\) second order cone programs
• A framework for solving mixed-integer semidefinite programs
• Conic mixed-integer rounding cuts
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems

Describes a project that uses

Uses Software

• Bonmin

This page was built for publication: Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs

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