Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm

DOI10.1016/J.ENDM.2010.05.040zbMath1237.90206OpenAlexW2064300984MaRDI QIDQ2883578

Alexandre Salles da Cunha, Leonardo Conegundes Martinez

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

branch-and-cutmin-degree constrained minimum spanning tree problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• Solving Steiner tree problems in graphs to optimality

This page was built for publication: Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm