Pages that link to "Item:Q833581"
From MaRDI portal
The following pages link to A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581):
Displayed 5 items.
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
- A new optimal electricity market bid model solved through perspective cuts (Q1948528) (← links)
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems (Q2393069) (← links)