Single-commodity robust network design problem: complexity, instances and heuristic solutions
DOI10.1016/J.EJOR.2014.04.023zbMATH Open1338.90073OpenAlexW2030583267MaRDI QIDQ296864FDOQ296864
Authors: Eduardo Álvarez-Miranda, Valentina Cacchiani, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt 
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/772/1/techreport.pdf
Recommendations
- Single-commodity robust network design with finite and hose demand sets
- Single-commodity network design with random edge capacities
- Models and algorithms for robust network design with several traffic scenarios
- Generalized hose uncertainty in single-commodity robust network design
- A robustness approach to uncapacitated network design problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)
Cites Work
- The Price of Robustness
- Robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Design of Survivable Networks: A survey
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Minimum cost capacity installation for multicommodity network flows
- On capacitated network design cut-set polyhedra
- The robust network loading problem with dynamic routing
- An exact algorithm for robust network design
- Models and algorithms for robust network design with several traffic scenarios
- An Application of Generalized Linear Programming to Network Flows
- Provisioning virtual private networks under traffic uncertainty
- Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
- Routing of uncertain traffic demands
- An evolutionary algorithm for polishing mixed integer programming solutions
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- Synthesis of a Communication Net
- Multi-Terminal Network Flows
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Proximity search for 0--1 mixed-integer convex programming
- Robust network design: formulations, valid inequalities, and computations
Cited In (6)
- Single-commodity robust network design with finite and hose demand sets
- On the robustness of potential-based flow networks
- Exact approaches for designing multifacility buy-at-bulk networks
- Network design in scarce data environment using moment-based distributionally robust optimization
- Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty
- Designing networks with resiliency to edge failures using two-stage robust optimization
Uses Software
This page was built for publication: Single-commodity robust network design problem: complexity, instances and heuristic solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296864)
