Single-commodity robust network design problem: complexity, instances and heuristic solutions
From MaRDI portal
Publication:296864
DOI10.1016/j.ejor.2014.04.023zbMath1338.90073OpenAlexW2030583267MaRDI QIDQ296864
Eduardo Álvarez-Miranda, Tiziano Parriani, Daniel R. Schmidt, Valentina Cacchiani, Andrea Lodi
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
Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
Single-commodity robust network design with finite and hose demand sets, Network design in scarce data environment using moment-based distributionally robust optimization, On the robustness of potential-based flow networks, Exact Approaches for Designing Multifacility Buy-at-Bulk Networks, Designing networks with resiliency to edge failures using two-stage robust optimization
Uses Software
Cites Work
- Proximity search for 0--1 mixed-integer convex programming
- Routing of uncertain traffic demands
- Minimum cost capacity installation for multicommodity network flows
- Robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- On capacitated network design cut-set polyhedra
- The robust network loading problem with dynamic routing
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- An Exact Algorithm for Robust Network Design
- Models and Algorithms for Robust Network Design with Several Traffic Scenarios
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- Synthesis of a Communication Net
- An Application of Generalized Linear Programming to Network Flows
- Provisioning virtual private networks under traffic uncertainty
- The Price of Robustness
- Multi-Terminal Network Flows
- Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Design of Survivable Networks: A survey
- Robust network design: Formulations, valid inequalities, and computations
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
