A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
From MaRDI portal
Publication:3462302
DOI10.1007/978-3-319-17689-5_1zbMath1330.65083OpenAlexW2276733260MaRDI QIDQ3462302
Tamás Terlaky, Imre Pólik, Ted K. Ralphs, Pietro Belotti, Julio César Góez
Publication date: 5 January 2016
Published in: Numerical Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17689-5_1
convex optimizationmixed integer optimizationbranch-and-cut algorithmssecond-order cone optimizationgraphical exampleconic cuts
Numerical mathematical programming methods (65K05) Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Maximal Quadratic-Free Sets, On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables, On sublinear inequalities for mixed integer conic programs, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, Strong formulations for quadratic optimization with M-matrices and indicator variables, Disjunctive cuts in mixed-integer conic optimization, Two-term disjunctions on the second-order cone, Lifted polymatroid inequalities for mean-risk optimization with indicator variables, Submodularity in Conic Quadratic Mixed 0–1 Optimization, How to convexify the intersection of a second order cone and a nonconvex quadratic, Supermodular covering knapsack polytope, A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization, Mixed integer programming with a class of nonlinear convex constraints, Intersection cuts for convex mixed integer programs from translated cones, On valid inequalities for mixed integer \(p\)-order cone programming, Split cuts and extended formulations for mixed integer conic quadratic programming, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, Strong formulations for conic quadratic optimization with indicator variables, On Minimal Valid Inequalities for Mixed Integer Conic Programs, On pathological disjunctions and redundant disjunctive conic cuts, Ideal formulations for constrained convex optimization problems with indicator variables, Maximal quadratic-free sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- Using a conic formulation for finding Steiner minimal trees
- Lifting for conic mixed-integer programming
- Algorithm for cardinality-constrained quadratic optimization
- Conic mixed-integer rounding cuts
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- Valid inequalities for mixed integer linear programs
- Risk optimization with \(p\)-order conic constraints: a linear programming approach
- Disjunctive programming: Properties of the convex hull of feasible points
- Review of nonlinear mixed-integer and disjunctive programming techniques
- A branch-and-cut method for 0-1 mixed convex programming
- The split closure of a strictly convex body
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- A convex-analysis perspective on disjunctive cuts
- Cuts for mixed 0-1 conic programming
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
- Disjunctive Programming
- Convex Analysis
- On Polyhedral Approximations of the Second-Order Cone
