Pages that link to "Item:Q1785310"
From MaRDI portal
The following pages link to Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310):
Displayed 26 items.
- On sublinear inequalities for mixed integer conic programs (Q312706) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization (Q1751214) (← links)
- Some cut-generating functions for second-order conic sets (Q1751217) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Intersection cuts for convex mixed integer programs from translated cones (Q1751221) (← links)
- Disjunctive cuts for cross-sections of the second-order cone (Q1785397) (← links)
- Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
- On pathological disjunctions and redundant disjunctive conic cuts (Q2294223) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
