Networks with unicyclic connected components and without short cycles - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2010

Networks with unicyclic connected components and without short cycles

Résumé

This paper focuses on the design of networks with unicyclic connected components. The size of each cycle should not be less than a given number. A polyhedral study is proposed. Many facets and valid inequalities are derived. Some of them can be exactly separated in polynomial time. Then the network design problem is solved by a cutting plane algorithm based on these inequalities and using a compact formulation issued from the transversality of the bicircular matroid.

Dates et versions

hal-00528556 , version 1 (22-10-2010)

Identifiants

Citer

Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou. Networks with unicyclic connected components and without short cycles. Electronic Notes in Discrete Mathematics, 2010, 36 (1), pp.961-968. ⟨10.1016/j.endm.2010.05.122⟩. ⟨hal-00528556⟩
47 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More