\(k\)-adaptive routing for the robust network loading problem

DOI10.1016/j.endm.2018.01.011zbMath1392.90018OpenAlexW2789782492MaRDI QIDQ1742208

Michael Poss, Marco Silva, Nelson F. Maculan

Publication date: 11 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.01.011

zbMATH Keywords

\(k\)-adaptabilityrobust linear optimizationbudget uncertainty setnetwork loading problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Related Items (1)

New advances and applications in deterministic and stochastic network optimization

Uses Software

• SNDlib
• Julia

Cites Work

• Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
• A comparison of routing sets for robust network design
• Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
• The robust network loading problem with dynamic routing
• Multistage Robust Mixed-Integer Optimization with Adaptive Partitions
• Multistage Adjustable Robust Mixed-Integer Optimization via Iterative Splitting of the Uncertainty Set
• Robust routing and optimal partitioning of a traffic demand polytope
• Computing in Operations Research Using Julia
• The Price of Robustness
• Finite Adaptability in Multistage Linear Optimization
• Robust network design: Formulations, valid inequalities, and computations
• Affine recourse for the robust network design problem: Between static and dynamic routing

This page was built for publication: \(k\)-adaptive routing for the robust network loading problem