A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study

DOI10.1287/opre.2017.1679zbMath1455.90118OpenAlexW2788490140MaRDI QIDQ4969341

Luca G. Gianoli, Erick Delage, Brunilde Sansó

Publication date: 5 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f95347e183f8c7c3c55cb84c48a5d308ed83b1bb

zbMATH Keywords

nonlinear programmingrobust optimizationnetwork optimizationqueuing delaydata-driven optimizationIP and packet network routing

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22) Robustness in mathematical programming (90C17)

Related Items

Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem, Data-Driven Robust Resource Allocation with Monotonic Cost Functions

Uses Software

• SNDlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
• Robust delay-constrained routing in telecommunications
• Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
• Increasing internet capacity using local search
• A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
• Routing of uncertain traffic demands
• Tractable approximate robust geometric programming
• The ellipsoid method and its consequences in combinatorial optimization
• Robust solutions of uncertain linear programs
• Robust discrete optimization and network flows
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust optimization-methodology and applications
• Robust counterparts of inequalities containing sums of maxima of linear functions
• Recent advances in robust optimization: an overview
• The robust network loading problem with dynamic routing
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Robust Convex Optimization
• Linear Programming under Uncertainty
• Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications
• Constructing Uncertainty Sets for Robust Linear Optimization
• Robust Optimization for Unconstrained Simulation-Based Problems
• Theory and Applications of Robust Optimization
• The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
• Provisioning virtual private networks under traffic uncertainty
• The Price of Robustness
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
• Affine recourse for the robust network design problem: Between static and dynamic routing
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems