Network design in scarce data environment using moment-based distributionally robust optimization
type: Item
instance of: scholarly article
title: Network design in scarce data environment using moment-based distributionally robust optimization
zbMATH Open document ID: 1391.90120
author: Hideaki Nakao
author: Siqian Shen
author: Zhihao Chen
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6902759
zbMATH Keywords: stochastic/robust network design
zbMATH Keywords: distributionally robust optimization
zbMATH Keywords: mixed-integer linear programming
zbMATH Keywords: polynomial linearization
zbMATH Keywords: cutting-plane algorithm
describes a project that uses: SNDlib
MaRDI profile type: Publication
full work available at URL: j.cor.2017.07.002
OpenAlex ID: W2728742075
cites work: The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations
cites work: Single-commodity robust network design problem: complexity, instances and heuristic solutions
cites work: Two-Stage Robust Network Flow and Design Under Demand Uncertainty
cites work: Decomposition for adjustable robust linear optimization subject to uncertainty polytope
cites work: Robust capacity assignment solutions for telecommunications networks with uncertain demands
cites work: Routing of uncertain traffic demands
cites work: Robust convex optimization
cites work: Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: Introduction to Stochastic Programming
cites work: Single-commodity robust network design with finite and hose demand sets
cites work: On distributionally robust chance-constrained linear programs
cites work: Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
cites work: An improved Benders decomposition applied to a multi-layer network design problem
cites work: A heuristic for moment-matching scenario generation
cites work: Data-driven chance constrained stochastic program
cites work: The sample average approximation method for stochastic discrete optimization
cites work: Robust network design: Formulations, valid inequalities, and computations
cites work: Benders decomposition approach for the robust network design problem with flow bifurcations
cites work: The robust network loading problem with dynamic routing
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Q4663414
cites work: Models and algorithms for network design problems
cites work: Affine recourse for the robust network design problem: Between static and dynamic routing
cites work: A stochastic programming approach for supply chain network design under uncertainty
cites work: On improving optimal oblivious routing
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
cites work: Distributionally Robust Convex Optimization
DOI: 10.1016/J.COR.2017.07.002
description: scientific article; zbMATH DE number 6902759