Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
From MaRDI portal
Publication:5740209
DOI10.1287/opre.2016.1486zbMath1342.90036OpenAlexW2308580644MaRDI QIDQ5740209
Michael Poss, Yoann Fouquet, Michał Pióro, Dritan Nace
Publication date: 25 July 2016
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2016.1486
robust optimizationmulticommodity flowsmixed-integer programmingsurvivable network designpath generationmultiple partial link failures
Related Items (5)
A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity ⋮ Travel Time Estimation in the Age of Big Data ⋮ Path generation for affine flow thinning ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
Uses Software
Cites Work
- Unnamed Item
- Adjustable robust solutions of uncertain linear programs
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- Complexity of column generation in network design with path-based survivability mechanisms
- On the complexity of resilient network design
- A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks
- The Price of Robustness
- Affine recourse for the robust network design problem: Between static and dynamic routing
- Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
- Two Consequences of the Transposition Theorem on Linear Inequalities
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
