Pages that link to "Item:Q3100691"

The following pages link to Progressive hedging-based metaheuristics for stochastic network design (Q3100691):

Displaying 32 items.

• 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)
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design (Q336890) (← links)
• Recent trends in metaheuristics for stochastic combinatorial optimization (Q692975) (← links)
• A metaheuristic for stochastic service network design (Q707730) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty (Q1628038) (← links)
• BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs (Q1727944) (← links)
• Managing congestion in a multi-modal transportation network under biomass supply uncertainty (Q1730690) (← links)
• Sample average approximation under non-i.i.d. sampling for stochastic empty container repositioning problem (Q2018108) (← 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)
• A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (Q2148147) (← links)
• Decision-based scenario clustering for decision-making under uncertainty (Q2171324) (← links)
• Bayesian generalized network design (Q2202025) (← links)
• PySP: modeling and solving stochastic programs in Python (Q2392659) (← links)
• A scenario decomposition algorithm for 0-1 stochastic programs (Q2450729) (← links)
• A progressive hedging approach for surgery planning under uncertainty (Q2802252) (← 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)
• (Q5075788) (← links)
• The Benders Dual Decomposition Method (Q5130513) (← links)
• Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs (Q5131712) (← links)
• Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions (Q5137443) (← links)
• Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs (Q5139855) (← links)
• Progressive hedging as a meta-heuristic applied to stochastic lot-sizing (Q5938398) (← links)
• A stochastic programming approach for chemotherapy appointment scheduling (Q6052539) (← links)
• Multiperiod transshipment location–allocation problem with flow synchronization under stochastic handling operations (Q6087146) (← links)
• Problem-driven scenario clustering in stochastic optimization (Q6088772) (← links)
• Joint tank container demurrage policy and flow optimisation using a progressive hedging algorithm with expanded time-space network (Q6109813) (← links)
• Stochastic forestry planning under market and growth uncertainty (Q6164380) (← links)
• An asynchronous parallel benders decomposition method for stochastic network design problems (Q6551056) (← links)