Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1287/opre.45.3.365 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2038970683 / rank | |||
Normal rank |
Latest revision as of 00:43, 20 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