Pages that link to "Item:Q3675916"
From MaRDI portal
The following pages link to On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916):
Displaying 12 items.
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← 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)
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (Q2815438) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Facet inequalities from simple disjunctions in cutting plane theory (Q3707764) (← links)
