A strong symmetric formulation for the min-degree constrained minimum spanning tree problem

DOI10.1016/j.endm.2016.03.031zbMath1351.90069MaRDI QIDQ325449

Mohammad Hasan, M. Dambrine

Publication date: 18 October 2016

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

zbMATH Keywords

branch-and-cut algorithm; valid inequalities; min-degree minimum spanning tree

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B18: Communication networks in operations research

90C05: Linear programming