Pages that link to "Item:Q2490334"
From MaRDI portal
The following pages link to Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334):
Displayed 9 items.
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes (Q833581) (← links)
- Demand allocation with latency cost functions (Q2429466) (← links)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP (Q2643791) (← links)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)