Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem (Q3342216): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.31.5.938 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.31.5.938 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093665022 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.31.5.938 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:15, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem |
scientific article |
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
