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

DOI10.1016/j.endm.2010.05.093zbMath1237.90160MaRDI QIDQ2883643

Sebastian Pokutta, Sarah Drewes

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

90C09: Boolean programming

Related Items

Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach, How to convexify the intersection of a second order cone and a nonconvex quadratic, Two-term disjunctions on the second-order cone, Disjunctive cuts for cross-sections of the second-order cone, On Minimal Valid Inequalities for Mixed Integer Conic Programs

Cites Work

• Unnamed Item
• Algorithm for cardinality-constrained quadratic optimization
• Applications of second-order cone programming
• Robust solutions of uncertain linear programs
• Second-order cone programming
• A branch-and-cut method for 0-1 mixed convex programming
• Portfolio optimization with linear and fixed transaction costs
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
• Cuts for Conic Mixed-Integer Programming