An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188)
From MaRDI portal
scientific article; zbMATH DE number 7303821
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem |
scientific article; zbMATH DE number 7303821 |
Statements
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (English)
0 references
1 February 2021
0 references
close-enough
0 references
traveling salesman problem
0 references
neighborhoods
0 references
carousel greedy
0 references
drones
0 references
0 references
0 references
0 references
