A tabu search heuristic for the generalized minimum spanning tree problem (Q933503)
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 tabu search heuristic for the generalized minimum spanning tree problem |
scientific article; zbMATH DE number 5303221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search heuristic for the generalized minimum spanning tree problem |
scientific article; zbMATH DE number 5303221 |
Statements
A tabu search heuristic for the generalized minimum spanning tree problem (English)
0 references
21 July 2008
0 references
generalized minimum spanning tree
0 references
tabu search
0 references
0 references
0 references
0 references
0 references
0.8860644698143005
0 references
0.8752403259277344
0 references
0.8637845516204834
0 references
0.8610059022903442
0 references
