scientific article
From MaRDI portal
Publication:2861518
zbMath1274.90446MaRDI QIDQ2861518
Walid Ben-Ameur, Makhlouf Hadji
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001241
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The Steiner cycle polytope
- Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem
- The Capacitated m-Ring-Star Problem
- Odd Minimum Cut-Sets and b-Matchings
- BICIRCULAR MATROIDS
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth
- Maximum matching and a polyhedron with 0,1-vertices
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: