Pages that link to "Item:Q1866131"

The following pages link to Decomposition algorithms for stochastic programming on a computational grid (Q1866131):

Displaying 50 items.

• Acceleration strategies of Benders decomposition for the security constraints power system expansion planning (Q256646) (← links)
• A regularized simplex method (Q302140) (← links)
• The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences (Q320748) (← links)
• Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
• An effective heuristic for multistage linear programming with a stochastic right-hand side (Q337144) (← links)
• Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
• The impact of sampling methods on bias and variance in stochastic linear programs (Q434168) (← links)
• Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
• A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
• A warm-start approach for large-scale stochastic linear programs (Q535016) (← links)
• On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty (Q889106) (← links)
• A trust region method for the solution of the surrogate dual in integer programming (Q896175) (← links)
• Computational study of decomposition algorithms for mean-risk stochastic linear programs (Q903926) (← links)
• Efficient batch job scheduling in grids using cellular memetic algorithms (Q928683) (← links)
• Adaptive multicut aggregation for two-stage stochastic linear programs with recourse (Q976324) (← links)
• Enhancements of two-stage stochastic decomposition (Q1010300) (← links)
• Analysis of stochastic problem decomposition algorithms in computational grids (Q1026583) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• Preemptive rerouting of airline passengers under uncertain delays (Q1652495) (← links)
• An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming (Q1713765) (← links)
• Efficient solution selection for two-stage stochastic programs (Q1740544) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• An improved L-shaped method for solving process flexibility design problems (Q1793161) (← links)
• Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
• A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl (Q2099497) (← links)
• Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS (Q2149952) (← links)
• An ADMM algorithm for two-stage stochastic programming problems (Q2178363) (← links)
• A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption (Q2183874) (← links)
• Exploiting structure in parallel implementation of interior point methods for optimization (Q2271797) (← links)
• Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables (Q2284466) (← links)
• Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method (Q2355924) (← links)
• Parallelizable preprocessing method for multistage stochastic programming problems (Q2370063) (← links)
• A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition (Q2392864) (← links)
• Parallel distributed-memory simplex for large-scale stochastic LP problems (Q2393649) (← links)
• A simple version of bundle method with linear programming (Q2419511) (← links)
• Multicut Benders decomposition algorithm for process supply chain planning under uncertainty (Q2442082) (← links)
• On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
• Parallel interior-point solver for structured quadratic programs: Application to financial planning problems (Q2480251) (← links)
• A stochastic programming approach for supply chain network design under uncertainty (Q2484345) (← links)
• Convexity and decomposition of mean-risk stochastic programs (Q2492670) (← links)
• The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
• Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
• A management system for decompositions in stochastic programming (Q2507408) (← links)
• Some insights into the solution algorithms for SLP problems (Q2507411) (← links)
• The empirical behavior of sampling methods for stochastic programming (Q2507414) (← links)
• Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
• Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction (Q2957466) (← links)
• Reformulation and sampling to solve a stochastic network interdiction problem (Q3184597) (← links)
• An Embarrassingly Parallel Method for Large-Scale Stochastic Programs (Q3296384) (← links)
• Meta-heuristics for Grid Scheduling Problems (Q3603106) (← links)