A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

DOI10.1007/978-3-540-72845-0_29zbMath1203.68121OpenAlexW1879012921MaRDI QIDQ5432327

Michael Jünger, Markus Behle, Frauke Liers

Publication date: 2 January 2008

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72845-0_29

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm

This page was built for publication: A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem