Publication:2027067

DOI10.1016/j.cor.2020.105182OpenAlexW3111102891MaRDI QIDQ2027067

Dario Landa-Silva, Graham Kendall, Stein W. Wallace, Ruibin Bai, Xiaoping Jiang

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://eprints.nottingham.ac.uk/64316/1/011510252858MergePDF.pdf

zbMATH Keywords

network designprogressive hedgingscenario bundlingstochastic mixed-integer programs

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Lagrange dual bound computation for stochastic service network design, Stochastic scheduling of chemotherapy appointments considering patient acuity levels

Uses Software

• CPLEX
• PySP
• k-means++
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating Scenario Trees for Multistage Decision Problems
• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
• Complex investment decisions using rough set and fuzzy c-means: an example of investment in green supply chains
• Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
• Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure
• Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization
• Cluster Lagrangean decomposition in multistage stochastic optimization
• Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Multiset theory
• Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
• Service network design in freight transportation
• Which problems have strongly exponential complexity?
• Integration of progressive hedging and dual decomposition in stochastic integer programs
• A heuristic for moment-matching scenario generation
• PySP: modeling and solving stochastic programs in Python
• Service network design for freight transportation: a review
• A stochastic programming approach for supply chain network design under uncertainty
• Modeling with Stochastic Programming
• Introduction to Stochastic Programming
• Large-Scale, Less-than-Truckload Service Network Design
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Model-Based Gaussian and Non-Gaussian Clustering
• The Continuous-Time Service Network Design Problem
• Combining Progressive Hedging with a Frank--Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming
• Least squares quantization in PCM
• Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions
• Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
• A scheme for determining vehicle routes based on Arc-based service network design