A directed cycle-based column-and-cut generation method for capacitated survivable network design
From MaRDI portal
Recommendations
Cites work
- Capacitated Network Design—Polyhedral Structure and Computation
- Cost-efficient network synthesis from leased lines
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Network flows. Theory, algorithms, and applications.
- On capacitated network design cut-set polyhedra
- On the facets of the mixed-integer knapsack polyhedron
- SONET/SDH ring assignment with capacity constraints
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
- Strong inequalities for capacitated survivable network design problems.
- The bounded cycle-cover problem
- The convex hull of two core capacitated network design problems
- Topological design of ring networks
Cited in
(15)- A polyhedral approach to multicommodity survivable network design
- Intersection cuts for single row corner relaxations
- Formulations for designing robust networks. An application to wind power collection
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Complexity of column generation in network design with path-based survivability mechanisms
- Polyhedral structure of the 4-node network design problem
- Survivable capacitated network design problem: new formulation and Lagrangean relaxation
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Optimal network design with end-to-end service requirements
- Design of survivable networks based on p-cycles
- Valid inequalities and facets for multi‐module survivable network design problem
- Robust capacitated Steiner trees and networks with uniform demands
- Cover and pack inequalities for (mixed) integer programming
- Partition inequalities for capacitated survivable network design based on directed p-cycles
This page was built for publication: A directed cycle-based column-and-cut generation method for capacitated survivable network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474304)
