An exact algorithm for robust network design
From MaRDI portal
Recommendations
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- Robust network design: formulations, valid inequalities, and computations
- Models and algorithms for robust network design with several traffic scenarios
- An optimal capacity assignment for the robust design problem in capacitated flow networks
- Survivable network design with demand uncertainty
Cited in
(25)- A robustness approach to uncapacitated network design problems
- Solving a network design problem
- An optimal capacity assignment for the robust design problem in capacitated flow networks
- Generalized hose uncertainty in single-commodity robust network design
- A global optimization algorithm for reliable network design
- Network design with a discrete set of traffic matrices
- A robust optimization model for distribution network design under a mixed integer set of scenarios
- On the robustness of potential-based flow networks
- An approximate algorithm for the robust design in a stochastic-flow network
- Single-commodity robust network design with finite and hose demand sets
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
- Models and algorithms for robust network design with several traffic scenarios
- scientific article; zbMATH DE number 5952694 (Why is no real title available?)
- scientific article; zbMATH DE number 6602509 (Why is no real title available?)
- An approach to robust network design in telecommunications
- An exact algorithm for the network pricing problem
- Technical note: Branch-and-price-and-cut approach to the robust network design problem without flow bifurcations
- Target cuts from relaxed decision diagrams
- An Algorithm for the Design of Multitype Concentrator Networks
- Robust network design: formulations, valid inequalities, and computations
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
- Deterministic sampling algorithms for network design
- Valid cuts for the design of potential-based flow networks
- Reformulating the disjunctive cut generating linear program
This page was built for publication: An exact algorithm for robust network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3091477)
