A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem (Q1791944)
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 hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem |
scientific article; zbMATH DE number 6951757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem |
scientific article; zbMATH DE number 6951757 |
Statements
A hybrid VNS algorithm for solving the multi-level capacitated minimum spanning tree problem (English)
0 references
11 October 2018
0 references
multi-level capacitated minimum spanning tree
0 references
variable neighborhood search
0 references
combinatorial optimization
0 references
neighborhood structures
0 references
0 references
0.8683790564537048
0 references
0.8467661738395691
0 references
0.8450477123260498
0 references
0.8259787559509277
0 references
0.8247684240341187
0 references
