Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986)
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 7546491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid search with neighborhood reduction for the multiple traveling salesman problem |
scientific article; zbMATH DE number 7546491 |
Statements
Hybrid search with neighborhood reduction for the multiple traveling salesman problem (English)
0 references
22 June 2022
0 references
traveling salesman
0 references
multiple traveling salesman
0 references
hybrid heuristic
0 references
neighborhood reduction
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8285236954689026
0 references
0.8195699453353882
0 references
0.8085822463035583
0 references
0.7966833114624023
0 references
