Pages that link to "Item:Q1078072"
From MaRDI portal
The following pages link to A branch and bound algorithm for extreme point mathematical programming problems (Q1078072):
Displayed 6 items.
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
- A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
- A finite algorithm for solving the generalized lattice point problem (Q1179205) (← links)
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← 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)