The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut

DOI10.1016/j.endm.2016.03.016zbMath1351.90043OpenAlexW2404189039MaRDI QIDQ325409

Raouia Taktak, Meriem Mahjoub, Ibrahima Diarrassouba, Ali Ridha Mahjoub

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.016

zbMATH Keywords

branch-and-cut algorithmpolytopeseparation\(k\)-node connected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• On the linear relaxation of the 2-node connected subgraph polytope
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
• \(k\)-edge connected polyhedra on series-parallel graphs
• A branch-and-cut algorithm for the k-edge connected subgraph problem
• The k-Edge-Connected Spanning Subgraph Polyhedron

This page was built for publication: The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut