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

DOI10.1002/net.21487zbMath1269.90087OpenAlexW2037598223MaRDI QIDQ5326798

Adam Ouorou, Walid Ben-Ameur, Makhlouf Hadji

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21487

zbMATH Keywords

combinatorial optimizationmatroidsnetwork designunicyclic graphspolyhedral studycutting-plane algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Unnamed Item, Unnamed Item

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• A matching problem with side conditions
• On a composition of independence systems by circuit identification
• Designing reliable tree networks with two cable technologies
• The maximum edge biclique problem is NP-complete
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Steiner \(k\)-edge connected subgraph polyhedra
• On the symmetric travelling salesman problem I: Inequalities
• On the symmetric travelling salesman problem II: Lifting theorems and facets
• The Capacitated m-Ring-Star Problem
• Locating a cycle in a transportation or a telecommunications network
• A new approach to the maximum-flow problem
• Edge-Deletion Problems
• BICIRCULAR MATROIDS
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A General Approximation Technique for Constrained Forest Problems
• Design of Survivable Networks: A survey