Two-connected networks with rings of bounded cardinality

DOI10.1023/B:COAP.0000008649.61438.6bzbMath1044.90057OpenAlexW2000148633MaRDI QIDQ1424779

Martine Labbé, Bernard Fortz

Publication date: 15 March 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:coap.0000008649.61438.6b

zbMATH Keywords

combinatorial optimizationnetwork designbranch-and-cut

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (5)

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 ⋮ A decomposition algorithm for the ring spur assignment problem ⋮ Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut

This page was built for publication: Two-connected networks with rings of bounded cardinality