Polyhedral results for two-connected networks with bounded rings

DOI10.1007/s10107-002-0299-9zbMath1007.90011OpenAlexW2001784810MaRDI QIDQ1849257

Martine Labbé, Bernard Fortz

Publication date: 1 December 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2078/18276

zbMATH Keywords

branch-and-cut algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

Related Items (6)

Survivability in hierarchical telecommunications networks ⋮ A branch‐and‐cut algorithm for the ring spur assignment problem ⋮ A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints ⋮ A Network Design Problem with Two-Edge Matching Failures ⋮ Critical extreme points of the 2-edge connected spanning subgraph polytope ⋮ Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut

This page was built for publication: Polyhedral results for two-connected networks with bounded rings