Pages that link to "Item:Q3707764"
From MaRDI portal
The following pages link to Facet inequalities from simple disjunctions in cutting plane theory (Q3707764):
Displaying 8 items.
- Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
- Cutting planes from two-term disjunctions (Q2450685) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Valid inequalities and cutting planes for some polytopes (Q4392322) (← links)
- Stability in disjunctive optimization II:continuity of the feasible and optimal set (Q4764595) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)