Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (Q4679783)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm |
scientific article; zbMATH DE number 2177423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm |
scientific article; zbMATH DE number 2177423 |
Statements
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (English)
0 references
21 June 2005
0 references
minimum spanning tree
0 references
branch-and-bound
0 references
Lagrangian relaxation
0 references
0.9525719
0 references
0.9500924
0 references
0.9468669
0 references
0.9355491
0 references
0.93294185
0 references
0.92958796
0 references
0.9285316
0 references
0.92761755
0 references
