A Lagrangean approach to the degree-constrained minimum spanning tree problem
The author presents an improved branch and bound algorithm for large random table problems and related variations of the Minimum Spanning Tree (MST) problem. Lagrange multipiers are used for better edge elimination analysis. Computational results (for up to 150 nodes) illustrate the effectiveness of the Lagrangean approach for such problems.
scientific article; zbMATH DE number 4104719