Solving the Two-Connected Network with Bounded Meshes Problem

DOI10.1287/OPRE.48.6.866.12390MaRDI QIDQ4530666zbMATHOpenAlexFDO

Authors Bernard Fortz, Martine Labbé, Francesco Maffioli

Publication date 4 June 2002

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.48.6.866.12390

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15)

Cited in

(13)

• Survivability in hierarchical telecommunications networks
• A branch-and-cut algorithm for two-level survivable network design problems
• Optimal capacitated ring trees
• The \(k\) edge-disjoint 3-hop-constrained paths polytope
• A decomposition algorithm for the ring spur assignment problem
• A primal partitioning approach for single and non-simultaneous multicommodity flow problems
• Critical extreme points of the 2-edge connected spanning subgraph polytope
• Network design with vulnerability constraints and probabilistic edge reliability
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
• A branch-and-cut algorithm for the ring spur assignment problem
• Hierarchical survivable network design problems
• Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut

This page was built for publication: Solving the Two-Connected Network with Bounded Meshes Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530666)