Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem (Q5689145): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
Revision as of 04:31, 29 February 2024
scientific article; zbMATH DE number 960915
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem |
scientific article; zbMATH DE number 960915 |
Statements
Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem (English)
0 references
20 February 1997
0 references
time-dependent traveling salesman problem
0 references
directed multipartite graph representation
0 references
upper bound
0 references
Benders-decomposition-based heuristic
0 references
