An efficient branch and bound algorithm for the CMST problem

MaRDI QIDQ3513694zbMATH OpenFDO

Authors Xian Li, Jun Han, Xuelian Lin, Xu-Dong Liu

Publication date 6 August 2008

zbMATH Keywords

branch and boundminimum spanning treepruningsearch tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Deterministic network models in operations research (90B10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 2090612
• A branch and bound algorithm for the capacitated minimum spanning tree problem
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• Heuristics for the multi-level capacitated minimum spanning tree problem
• Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem

Cited in

(4)

• Heuristic procedure neural networks for the CMST problem
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• scientific article; zbMATH DE number 2090612 (Why is no real title available?)
• Recent Advances in Constraints

This page was built for publication: An efficient branch and bound algorithm for the CMST problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3513694)