Pages that link to "Item:Q2450729"

The following pages link to A scenario decomposition algorithm for 0-1 stochastic programs (Q2450729):

Displaying 30 items.

• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs (Q517291) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs (Q1727944) (← links)
• Shelter site location under multi-hazard scenarios (Q1734830) (← links)
• An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees (Q1762093) (← links)
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
• Scenario-based learning for stochastic combinatorial optimisation (Q2011603) (← links)
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
• Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
• Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
• A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models (Q2235163) (← links)
• Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
• Multi-modal cargo logistics distribution problem: decomposition of the stochastic risk-averse models (Q2668704) (← links)
• An Embarrassingly Parallel Method for Large-Scale Stochastic Programs (Q3296384) (← links)
• Optimization-Driven Scenario Grouping (Q3386802) (← links)
• <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590) (← links)
• An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming (Q4620422) (← links)
• Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
• A New Scenario Decomposition Method for Large-Scale Stochastic Optimization (Q4861361) (← links)
• Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs (Q4995100) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs (Q5131712) (← links)
• Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs (Q5139855) (← links)
• Communication-Constrained Expansion Planning for Resilient Distribution Systems (Q5148181) (← links)
• A Scalable Bounding Method for Multistage Stochastic Programs (Q5348474) (← links)
• A stochastic programming approach for chemotherapy appointment scheduling (Q6052539) (← links)
• Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems (Q6066721) (← links)
• Drones for relief logistics under uncertainty after an earthquake (Q6113313) (← links)
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)