Design of Survivable Networks: A survey
From MaRDI portal
Publication:5318274
DOI10.1002/net.20072zbMath1072.90003OpenAlexW4211176206MaRDI QIDQ5318274
Hervé L. M. Kerivin, Ali Ridha Mahjoub
Publication date: 22 September 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20072
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A stochastic optimization model to reduce expected post-disaster response time through pre-disaster investment decisions, A generic optimization framework for resilient systems, Strong Lower Bounds for a Survivable Network Design Problem, Survivability in hierarchical telecommunications networks, Optimal capacitated ring trees, Incremental network design with shortest paths, Single-commodity robust network design problem: complexity, instances and heuristic solutions, Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron, A global optimization algorithm for reliable network design, Network Design with Service Requirements: Scaling-up the Size of Solvable Problems, Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems, Network design and defence, Unreliable point facility location problems on networks, Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice, Energy-aware survivable networks, Hierarchical survivable network design problems, Branch-and-cut methods for the network design problem with vulnerability constraints, On the hop-constrained survivable network design problem with reliable edges, A branch-and-cut algorithm for two-level survivable network design problems, Finding Totally Independent Spanning Trees with Linear Integer Programming, Hop‐level flow formulation for the survivable network design with hop constraints problem, Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth, Exact interdiction models and algorithms for disconnecting networks via node deletions, Design of survivable wireless backhaul networks with reliability considerations, New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, An exact approach for the reliable fixed-charge location problem with capacity constraints, Valid inequalities and facets for multi‐module survivable network design problem, Robust capacitated Steiner trees and networks with uniform demands, Capacity-preserving subgraphs of directed flow networks, Design of survivable networks with vulnerability constraints, A survivable variant of the ring star problem, Solving survivable two-layer network design problems by metric inequalities, The \(k\) edge-disjoint 3-hop-constrained paths polytope, Survivability in Hierarchical Telecommunications Networks Under Dual Homing, A metaheuristic for security budget allocation in utility networks, Incremental Network Design with Minimum Spanning Trees, Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane, Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints, Fractional routing using pairs of failure-disjoint paths, Bilevel model for adaptive network flow problem, A hybrid optimization approach for the Steiner \(k\)-connected network design problem, Formulations for designing robust networks. An application to wind power collection, Optimal design and defense of networks under link attacks, The \(k\)-path tree matroid and its applications to survivable network design, Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs, Solving the optimum communication spanning tree problem, Stochastic survivable network design problems: theory and practice, A decomposition algorithm for the ring spur assignment problem, New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints, On the Steiner 2-edge connected subgraph polytope, On the chance-constrained minimum spanning \(k\)-core problem, A branch-and-cut algorithm for the k-edge connected subgraph problem, A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation, Optimization algorithms for resilient path selection in networks, On superperfection of edge intersection graphs of paths, A formulation for a hop constrained survivable network design problem, A Network Design Problem with Two-Edge Matching Failures, Strong Formulations for 2-Node-Connected Steiner Network Problems, Parameterized Approximation Algorithms for Bidirected Steiner Network Problems, Reliability problems in multiple path-shaped facility location on networks, The two-level diameter constrained spanning tree problem, A Lagrangian dual method for two-stage robust optimization with binary uncertainties, Critical extreme points of the 2-edge connected spanning subgraph polytope, Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut, Design and dimensioning of hydrogen transmission pipeline networks, Placing Green bridges optimally, with a multivariate analysis
Cites Work
- Design of survivable networks
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- TSPLIB—A Traveling Salesman Problem Library
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
