A new relaxation method for the generalized minimum spanning tree problem (Q2575572)
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: A new relaxation method for the generalized minimum spanning tree problem |
scientific article; zbMATH DE number 2235655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new relaxation method for the generalized minimum spanning tree problem |
scientific article; zbMATH DE number 2235655 |
Statements
A new relaxation method for the generalized minimum spanning tree problem (English)
0 references
5 December 2005
0 references
combinatorial optimization
0 references
minimum spanning trees
0 references
generalized minimum spanning tree problem
0 references
0 references
0.9415881633758544
0 references
0.929953932762146
0 references
0.9184824228286744
0 references
0.9151387810707092
0 references
