Solving a network design problem
From MaRDI portal
Recommendations
- A robustness approach to uncapacitated network design problems
- Models and algorithms for robust network design with several traffic scenarios
- 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
- An exact algorithm for robust network design
Cited in
(11)- Algorithm unions for solving discrete optimization problems
- Constraint games for stable and optimal allocation of demands in SDN
- Explanation-based large neighborhood search
- Double resource optimization for a robust computer network subject to a transmission budget
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
- On algorithm portfolios and restart strategies
- Principles for the design of large neighborhood search
- 0-1 reformulations of the multicommodity capacitated network design problem
- scientific article; zbMATH DE number 1487910 (Why is no real title available?)
This page was built for publication: Solving a network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1876540)
