Pages that link to "Item:Q847822"
From MaRDI portal
The following pages link to Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822):
Displaying 18 items.
- Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Lifting for conic mixed-integer programming (Q623366) (← links)
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (Q1424281) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
- Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization (Q5010043) (← links)
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables (Q5041763) (← links)
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- A graph-based decomposition method for convex quadratic optimization with indicators (Q6102761) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
