Cutting-planes for weakly-coupled 0/1 second order cone programs
From MaRDI portal
Publication:2883643
DOI10.1016/J.ENDM.2010.05.093zbMATH Open1237.90160OpenAlexW2038738864MaRDI QIDQ2883643FDOQ2883643
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
Recommendations
Cites Work
- 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
- Algorithm for cardinality-constrained quadratic optimization
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- Title not available (Why is that?)
- Cuts for Conic Mixed-Integer Programming
Cited In (5)
- On minimal valid inequalities for mixed integer conic programs
- 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
- Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach
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)