Complexity of column generation in network design with path-based survivability mechanisms
From MaRDI portal
Recommendations
- A directed cycle-based column-and-cut generation method for capacitated survivable network design
- scientific article; zbMATH DE number 1263260
- An efficient approximation algorithm for the survivable network design problem
- Fast exact algorithms for survivable network design with uniform requirements
- Fast exact algorithms for survivable network design with uniform requirements
- A unified algorithm for degree bounded survivable network design
- A unified algorithm for degree bounded survivable network design
- Design of survivable networks based on p-cycles
- Parameterized algorithms for survivable network design with uniform demands
Cites work
- Approximation algorithms and hardness results for labeled connectivity problems
- Assigning spare capacities in mesh survivable networks
- Disjoint paths in a network
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Mathematical programming. Theory and algorithms.
- Network flows. Theory, algorithms, and applications.
- Network synthesis under survivability constraints
- On Linear Characterizations of Combinatorial Optimization Problems
- On the complexity of resilient network design
- Shortest Path Problems with Resource Constraints
- The directed subgraph homeomorphism problem
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(9)- Path generation for affine flow thinning
- Resilient capacity-aware routing
- Complexity of a classical flow restoration problem
- Survivable network design with shared-protection routing
- Energy-aware survivable networks
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- Optimizing flow thinning protection in multicommodity networks with variable link capacity
- A robust optimization model for affine/quadratic flow thinning: A traffic protection mechanism for networks with variable link capacity
- An efficient approach to optimization of semi‐stable routing in multicommodity flow networks
This page was built for publication: Complexity of column generation in network design with path-based survivability mechanisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892152)
