Minimum-weight subgraphs with unicyclic components and a lower-bounded girth

Abstract : This article focuses on the problem of computing a minimum-weight subgraph with unicyclic connected components. Although this problem is generally easy, it becomes difficult when a girth constraint is added. A polyhedral study is proposed. Many facets and valid inequalities are derived. Some of them can be exactly separated in polynomial time. Hence, the problem is solved by a cutting-plane algorithm based on these inequalities and using a compact formulation derived from the transversality of the bicircular matroid. Numerical results are also presented.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00838401
Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Tuesday, June 25, 2013 - 3:23:14 PM
Last modification on : Thursday, January 16, 2020 - 1:14:19 AM

Links full text

Identifiers

Citation

Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Minimum-weight subgraphs with unicyclic components and a lower-bounded girth. Networks, Wiley, 2013, 61 (4), pp.335-355. ⟨10.1002/net.21487⟩. ⟨hal-00838401⟩

Share

Metrics

Record views

121