Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (Q3342216)
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 3876927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem |
scientific article; zbMATH DE number 3876927 |
Statements
Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (English)
0 references
1983
0 references
time-constrained traveling salesman
0 references
time window constraints
0 references
disjunctive graph model
0 references
longest path algorithm
0 references
branch and bound solution procedure
0 references
Computational results
0 references
0.8558887839317322
0 references
0.8307929635047913
0 references
0.8244614005088806
0 references
