A practicable robust counterpart formulation for decomposable functions: a network congestion case study

DOI10.1287/OPRE.2017.1679MaRDI QIDQ4969341zbMATH OpenOpenAlexFDO

Authors Erick Delage, Luca G. Gianoli, 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

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

Recommendations

• Robust delay-constrained routing in telecommunications
• Robust network design: formulations, valid inequalities, and computations
• Robust capacity expansion of network flows
• General robust-optimization formulation for nonlinear programming
• Robust multiobjective optimization with application to Internet routing

Cites work

• scientific article; zbMATH DE number 1667417 (Why is no real title available?)
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 2102031 (Why is no real title available?)
• A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
• Affine decision rules for tractable approximations to robust capacity planning in telecommunications
• Affine recourse for the robust network design problem: between static and dynamic routing
• Constructing uncertainty sets for robust linear optimization
• Increasing internet capacity using local search
• Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
• Linear programming under uncertainty
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
• Provisioning virtual private networks under traffic uncertainty
• Quantile regression.
• Recent advances in robust optimization: an overview
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Robust convex optimization
• Robust counterparts of inequalities containing sums of maxima of linear functions
• Robust delay-constrained routing in telecommunications
• Robust discrete optimization and network flows
• Robust optimization
• Robust optimization for unconstrained simulation-based problems
• Robust optimization of sums of piecewise linear functions with application to inventory problems
• Robust optimization-methodology and applications
• Robust solutions of linear programming problems contaminated with uncertain data
• Robust solutions of uncertain linear programs
• Routing of uncertain traffic demands
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
• The Price of Robustness
• The ellipsoid method and its consequences in combinatorial optimization
• The robust network loading problem with dynamic routing
• Theory and applications of robust optimization
• Tractable approximate robust geometric programming
• Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty

Cited in

(3)

• Data-driven robust resource allocation with monotonic cost functions
• Robust delay-constrained routing in telecommunications
• Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem

Describes a project that uses

Uses Software

• SNDlib

This page was built for publication: A practicable robust counterpart formulation for decomposable functions: a network congestion case study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969341)