Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 16:32, 5 March 2024
scientific article; zbMATH DE number 1091515
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints |
scientific article; zbMATH DE number 1091515 |
Statements
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (English)
0 references
16 August 1998
0 references
state space relaxation
0 references
traveling salesman
0 references
time window and precedence constraints
0 references
Hamiltonian tour
0 references
bounding functions
0 references
