Minimum-weight subgraphs with unicyclic components and a lower-bounded girth - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networks Année : 2013

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

Résumé

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.

Dates et versions

hal-00838401 , version 1 (25-06-2013)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More