Pages that link to "Item:Q1922690"
From MaRDI portal
The following pages link to A cutting plane method from analytic centers for stochastic programming (Q1922690):
Displaying 17 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Analytic center cutting plane methods for variational inequalities over convex bodies (Q824529) (← links)
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- Stability analysis for a special interval cutting problem (Q1390272) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty (Q2442082) (← links)
- A primal-dual decomposition algorithm for multistage stochastic convex programming (Q2571003) (← links)
- Optimized cutting plane algorithm for large-scale risk minimization (Q2880969) (← links)
- A Cutting Plane Approach for Chance Constrained Linear Programs (Q3988908) (← links)
- (Q4839597) (← links)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
