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 12 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← 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)
- Delay-constrained shortest paths: approximation algorithms and second-order cone models (Q2342143) (← links)
- Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems (Q2393069) (← links)
- Perspective Reformulations of the CTA Problem with <i>L</i><sub>2</sub> Distances (Q2931708) (← links)
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach (Q2940060) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)