A two-level metaheuristic for the all colors shortest path problem (Q1616945)
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 two-level metaheuristic for the all colors shortest path problem |
scientific article; zbMATH DE number 6974606
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-level metaheuristic for the all colors shortest path problem |
scientific article; zbMATH DE number 6974606 |
Statements
A two-level metaheuristic for the all colors shortest path problem (English)
0 references
7 November 2018
0 references
shortest path
0 references
colored graph
0 references
variable neighboord search
0 references
0 references
0 references
0 references
0.86913687
0 references
0.86879456
0 references
0 references
0.85311645
0 references
0.83628654
0 references
0.8330648
0 references
