A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Tabu search / rank | |||
Normal rank | |||
Revision as of 05:30, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A biased random-key genetic algorithm for the capacitated minimum spanning tree problem |
scientific article |
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
