Network design in scarce data environment using moment-based distributionally robust optimization
DOI10.1016/j.cor.2017.07.002zbMath1391.90120OpenAlexW2728742075MaRDI QIDQ1651520
Siqian Shen, Zhihao Chen, Hideaki Nakao
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.07.002
mixed-integer linear programmingdistributionally robust optimizationcutting-plane algorithmpolynomial linearizationstochastic/robust network design
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Single-commodity robust network design with finite and hose demand sets
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Data-driven chance constrained stochastic program
- Routing of uncertain traffic demands
- On improving optimal oblivious routing
- An improved Benders decomposition applied to a multi-layer network design problem
- Robust discrete optimization and network flows
- Decomposition for adjustable robust linear optimization subject to uncertainty polytope
- A heuristic for moment-matching scenario generation
- Models and algorithms for network design problems
- On distributionally robust chance-constrained linear programs
- The robust network loading problem with dynamic routing
- A stochastic programming approach for supply chain network design under uncertainty
- Robust Convex Optimization
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Robust capacity assignment solutions for telecommunications networks with uncertain demands
- The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
- Distributionally Robust Convex Optimization
- Introduction to Stochastic Programming
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- The Price of Robustness
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Robust network design: Formulations, valid inequalities, and computations
- Affine recourse for the robust network design problem: Between static and dynamic routing
- Benders decomposition approach for the robust network design problem with flow bifurcations
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming