Pages that link to "Item:Q336890"

The following pages link to Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design (Q336890):

Displaying 31 items.

• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
• Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic (Q323187) (← links)
• Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty (Q323260) (← links)
• Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network (Q1639274) (← links)
• BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs (Q1727944) (← links)
• Scenario-based learning for stochastic combinatorial optimisation (Q2011603) (← links)
• Soft clustering-based scenario bundling for a progressive hedging heuristic in stochastic service network design (Q2027067) (← links)
• Scheduled service network design with quality targets and stochastic travel times (Q2028837) (← links)
• Constraint generation for risk averse two-stage stochastic programs (Q2028853) (← links)
• Stochastic scheduling of chemotherapy appointments considering patient acuity levels (Q2098069) (← links)
• Decision-based scenario clustering for decision-making under uncertainty (Q2171324) (← links)
• Progressive hedging for stochastic programs with cross-scenario inequality constraints (Q2183566) (← links)
• Optimization of covered calls under uncertainty (Q2218910) (← links)
• Evaluation of scenario reduction algorithms with nested distance (Q2221467) (← links)
• Lagrange dual bound computation for stochastic service network design (Q2672131) (← links)
• A Lagrangian decomposition scheme for choice-based optimization (Q2676388) (← links)
• An Embarrassingly Parallel Method for Large-Scale Stochastic Programs (Q3296384) (← links)
• Optimization-Driven Scenario Grouping (Q3386802) (← links)
• Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems (Q4637497) (← links)
• A Learning-Based Matheuristic for Stochastic Multicommodity Network Design (Q4995093) (← links)
• Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs (Q4995100) (← links)
• Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse (Q5131710) (← links)
• Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs (Q5131712) (← links)
• A Scalable Bounding Method for Multistage Stochastic Programs (Q5348474) (← links)
• A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty (Q6062880) (← links)
• Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems (Q6066721) (← links)
• Problem-driven scenario clustering in stochastic optimization (Q6088772) (← links)
• Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach (Q6099458) (← links)
• A machine learning optimization approach for last-mile delivery and third-party logistics (Q6106567) (← links)