Solving a network design problem
DOI10.1023/B:ANOR.0000032577.81139.84zbMATH Open1156.90472OpenAlexW2003149804MaRDI QIDQ1876540FDOQ1876540
Authors: Alain Chabrier, Emilie Danna, Laurent Perron, Claude Le Pape 
Publication date: 20 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000032577.81139.84
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cited In (11)
- Constraint games for stable and optimal allocation of demands in SDN
- Explanation-based large neighborhood search
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Double resource optimization for a robust computer network subject to a transmission budget
- 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
- Title not available (Why is that?)
- Algorithm unions for solving discrete optimization problems
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)
