Pages that link to "Item:Q3462302"
From MaRDI portal
The following pages link to A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302):
Displayed 23 items.
- On sublinear inequalities for mixed integer conic programs (Q312706) (← 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)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization (Q1751214) (← 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)
- Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
- Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
- Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← 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)
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables (Q2423781) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)