Complexity of column generation in network design with path-based survivability mechanisms
Authors:
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Path Generation for a Class of Survivable Network Design Problems2008
- SHARED RISK RESOURCE GROUP COMPLEXITY AND APPROXIMABILITY ISSUESParallel Processing Letters, 2007
- Approximation algorithms and hardness results for labeled connectivity problemsJournal of Combinatorial Optimization, 2007
- Shortest Path Problems with Resource Constraints2006
- Demand-wise Shared Protection for Meshed Optical NetworksJournal of Network and Systems Management, 2005
- Diverse routing in optical mesh networksIEEE Transactions on Communications, 2003
- Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow ProblemsOperations Research, 2000
- A Cutting Plane Algorithm for Multicommodity Survivable Network Design ProblemsINFORMS Journal on Computing, 1998
- On Linear Characterizations of Combinatorial Optimization ProblemsSIAM Journal on Computing, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981