A Lagrangean approach to the degree-constrained minimum spanning tree problem (Q1121788): Difference between revisions
From MaRDI portal
Latest revision as of 14:41, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangean approach to the degree-constrained minimum spanning tree problem |
scientific article |
Statements
A Lagrangean approach to the degree-constrained minimum spanning tree problem (English)
0 references
1989
0 references
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.
0 references
degree-constrained trees
0 references
branch and bound
0 references
large random table problems
0 references
Minimum Spanning Tree
0 references
Lagrange multipiers
0 references
edge elimination
0 references
Computational results
0 references
0 references
