Symmetry-exploiting cuts for a class of mixed-0/1 second-order cone programs
DOI10.1016/J.DISOPT.2014.04.002zbMATH Open1308.90109OpenAlexW2076039085MaRDI QIDQ2339823FDOQ2339823
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
Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Mixed integer programming (90C11) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partitioning procedures for solving mixed-variables programming problems
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- Solving mixed integer nonlinear programs by outer approximation
- Second-order cone programming
- A branch-and-cut method for 0-1 mixed convex programming
- Generalized Benders decomposition
- 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
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- Integrality gaps for Sherali-Adams relaxations
- Sherali-adams relaxations of the matching polytope
- Cuts for mixed 0-1 conic programming
- Cuts for Conic Mixed-Integer Programming
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Cited In (2)
Uses Software
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)
