The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design

DOI10.1007/978-3-642-32147-4_10zbMath1370.90211OpenAlexW11389118MaRDI QIDQ3167616

Aurélien Questel, Pierre Fouilhoux

Publication date: 2 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32147-4_10

zbMATH Keywords

branch-and-cut algorithmpolyhedral approachnon-disjoint \(m\)-ring-star problemrealistic SDH network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Combinatorial optimization (90C27)

This page was built for publication: The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design