A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493)
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 biased random-key genetic algorithm for the capacitated minimum spanning tree problem |
scientific article; zbMATH DE number 6650852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A biased random-key genetic algorithm for the capacitated minimum spanning tree problem |
scientific article; zbMATH DE number 6650852 |
Statements
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (English)
0 references
10 November 2016
0 references
optimization
0 references
combinatorial optimization
0 references
networks
0 references
graphs
0 references
trees
0 references
spanning trees
0 references
capacitated minimum spanning tree
0 references
heuristics
0 references
biased random-key genetic algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8168356418609619
0 references
0.8130940198898315
0 references
0.7958440780639648
0 references
0.7928033471107483
0 references
