Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints (Q4367231)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints |
scientific article; zbMATH DE number 1091515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.903664231300354
0 references
0.8680899143218994
0 references
0.847548246383667
0 references
0.826205849647522
0 references
