Isolation branching: a branch and bound algorithm for the k-terminal cut problem

DOI10.1007/978-3-030-04651-4_42zbMath1441.90172OpenAlexW2901824585MaRDI QIDQ2327144

Mark Velednitsky, Dorit S. Hochbaum

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_42

zbMATH Keywords

optimizationclusteringbranch-and-bound\(k\)-terminal cutisolating cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts

Uses Software

• Gurobi

This page was built for publication: Isolation branching: a branch and bound algorithm for the k-terminal cut problem