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

DOI10.1002/NET.21487MaRDI QIDQ5326798zbMATH OpenOpenAlexFDO

Authors Walid Ben-Ameur, Makhlouf Hadji, Adam Ouorou

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 optimizationcutting-plane algorithmmatroidsnetwork designpolyhedral studyunicyclic graphs

Mathematics Subject Classification ID

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

Recommendations

• Designing Steiner networks with unicyclic connected components: an easy problem
• Networks with unicyclic connected components and without short cycles
• On cycle cones and polyhedra
• Steiner networks with unicyclic connected components
• On cycle cones and polyhedra

Cites work

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

Cited in

(6)

• Networks with unicyclic connected components and without short cycles
• Steiner networks with unicyclic connected components
• Designing Steiner networks with unicyclic connected components: an easy problem
• The minimum spanning subgraph problem with given cyclomatic number
• On cycle cones and polyhedra
• On cycle cones and polyhedra

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Minimum-weight subgraphs with unicyclic components and a lower-bounded girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326798)