The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040)
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: The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm |
scientific article; zbMATH DE number 5720310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm |
scientific article; zbMATH DE number 5720310 |
Statements
The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (English)
0 references
11 June 2010
0 references
quadratic minimum spanning tree problem
0 references
Lagrangian relaxation
0 references
local search
0 references
0.9093673825263976
0 references
0.8826537728309631
0 references
0.8821729421615601
0 references
