Cutting-planes for weakly-coupled 0/1 second order cone programs

DOI10.1016/J.ENDM.2010.05.093MaRDI QIDQ2883643zbMATH OpenOpenAlexFDO

Authors Sarah Drewes, Sebastian Pokutta

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.093

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• Symmetry-exploiting cuts for a class of mixed-\(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

• {{#invoke:WikidataIB|getLink|Q1968795}} A branch-and-cut method for 0-1 mixed convex programming
• {{#invoke:WikidataIB|getLink|Q2901026}} A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
• {{#invoke:WikidataIB|getLink|Q842777}} Algorithm for cardinality-constrained quadratic optimization
• {{#invoke:WikidataIB|getLink|Q2897292}} Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• {{#invoke:WikidataIB|getLink|Q1124764}} Applications of second-order cone programming
• {{#invoke:WikidataIB|getLink|Q5429254}} Cuts for Conic Mixed-Integer Programming
• {{#invoke:WikidataIB|getLink|Q3394516}} Mixed integer second order cone programming.
• {{#invoke:WikidataIB|getLink|Q2480252}} Portfolio optimization with linear and fixed transaction costs
• {{#invoke:WikidataIB|getLink|Q1306344}} Robust solutions of uncertain linear programs
• {{#invoke:WikidataIB|getLink|Q1411628}} Second-order cone programming

Cited in

(7)

• On minimal valid inequalities for mixed integer conic programs
• How to convexify the intersection of a second order cone and a nonconvex quadratic
• Disjunctive cuts for cross-sections of the second-order cone
• Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
• Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
• Two-term disjunctions on the second-order cone

This page was built for publication: Cutting-planes for weakly-coupled \(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 Q2883643)