Pages that link to "Item:Q3885524"
From MaRDI portal
The following pages link to On the generation of deep disjunctive cutting planes (Q3885524):
Displaying 13 items.
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
- On the redundancy of cutting planes for linear complementarity problems (Q3716850) (← links)
- Stability in disjunctive optimization II:continuity of the feasible and optimal set (Q4764595) (← links)
