Survivable network design with shared-protection routing
From MaRDI portal
Publication:296897
DOI10.1016/j.ejor.2014.04.047zbMath1338.90093OpenAlexW2045115150MaRDI QIDQ296897
Prahalad Venkateshan, Y. K. Agarwal
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.047
column generationlarge scale optimizationend-to-end restoration schemesshared protection survivable network design
Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Solving survivable two-layer network design problems by metric inequalities
- Minimum-weight two-connected spanning networks
- The convex hull of two core capacitated network design problems
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- On capacitated network design cut-set polyhedra
- Metric inequalities and the network loading problem
- Using mixed-integer programming to solve power grid blackout problems
- The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis
- Complexity of column generation in network design with path-based survivability mechanisms
- Polyhedral structure of the 4-node network design problem
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Connectivity Upgrade Models for Survivable Network Design
- Design of Survivable Networks Using Three- and Four-Partition Facets
- k-Partition-based facets of the network design problem
- Strong inequalities for capacitated survivable network design problems.
