Survivable capacitated network design problem: new formulation and Lagrangean relaxation
From MaRDI portal
Recommendations
- A polyhedral approach to multicommodity survivable network design
- scientific article; zbMATH DE number 795223
- scientific article; zbMATH DE number 1487910
- Network synthesis under survivability constraints
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
Cited in
(12)- Formulations for designing robust networks. An application to wind power collection
- Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
- Reliable routing of road-rail intermodal freight under uncertainty
- Survivable network design under optimal and heuristic interdiction scenarios
- A GRASP algorithm for a capacitated, fixed charge, multicommodity network flow problem with uncertain demand and survivability constraints
- A Lagrangean relaxation algorithm for flow optimization in survivable MPLS networks
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Design of survivable wireless backhaul networks with reliability considerations
- Reliable intermodal freight network expansion with demand uncertainties and network disruptions
- Distributionally robust joint chance-constrained approach for the stochastic survivable capacitated network design problem
- Joint chance-constrained survivable capacitated multi-commodity network design problem with demand uncertainty
- A surrogate and Lagrangian approach to constrained network problems
This page was built for publication: Survivable capacitated network design problem: new formulation and Lagrangean relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156578)
