Minimal cost linkages in graphs (Q1290153)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1299352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal cost linkages in graphs |
scientific article; zbMATH DE number 1299352 |
Statements
Minimal cost linkages in graphs (English)
0 references
10 June 1999
0 references
minimal cost linkages
0 references
min-sum non-intersecting paths
0 references
min-max non-intersecting paths
0 references
NP-completeness
0 references
genetic algorithms
0 references
simulated annealing
0 references
0.7322648763656616
0 references
0.7228031754493713
0 references
0.7179890275001526
0 references
0.7156144380569458
0 references
