Single-commodity robust network design problem: complexity, instances and heuristic solutions
From MaRDI portal
(Redirected from Publication:296864)
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
Cites work
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- An Application of Generalized Linear Programming to Network Flows
- An evolutionary algorithm for polishing mixed integer programming solutions
- An exact algorithm for robust network design
- Design of Survivable Networks: A survey
- Minimum cost capacity installation for multicommodity network flows
- Models and algorithms for robust network design with several traffic scenarios
- Multi-Terminal Network Flows
- On capacitated network design cut-set polyhedra
- Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
- Provisioning virtual private networks under traffic uncertainty
- Proximity search for 0--1 mixed-integer convex programming
- Robust network design: formulations, valid inequalities, and computations
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Routing of uncertain traffic demands
- Synthesis of a Communication Net
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The robust network loading problem with dynamic routing
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
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)
