Solving the Two-Connected Network with Bounded Meshes Problem

DOI10.1287/opre.48.6.866.12390zbMath1106.90312OpenAlexW2036527839MaRDI QIDQ4530666

Francesco Maffioli, Martine Labbé, Bernard Fortz

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)

Related Items (12)

Survivability in hierarchical telecommunications networks ⋮ Optimal capacitated ring trees ⋮ Hierarchical survivable network design problems ⋮ A branch-and-cut algorithm for two-level survivable network design problems ⋮ A branch‐and‐cut algorithm for the ring spur assignment problem ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints ⋮ 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 ⋮ Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut ⋮ Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks

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