Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem

DOI10.1137/090759033zbMath1219.90132OpenAlexW2007930126MaRDI QIDQ3013146

Walid Ben-Ameur, Makhlouf Hadji

Publication date: 18 July 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090759033

zbMATH Keywords

combinatorial optimizationmatchingmatroidsnetwork designSteiner networksunicyclic graphspolyhedral study

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ On the most imbalanced orientation of a graph

This page was built for publication: Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem