Pages that link to "Item:Q3009750"
From MaRDI portal
The following pages link to Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750):
Displaying 17 items.
- 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)
- 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)
- Disjunctive cuts for cross-sections of the second-order cone (Q1785397) (← links)
- Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- A partial outer convexification approach to control transmission lines (Q2419514) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
