Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming (Q4294336)
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 572302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming |
scientific article; zbMATH DE number 572302 |
Statements
Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming (English)
0 references
24 May 1994
0 references
state space relaxation
0 references
dial-a-ride
0 references
bounding procedure
0 references
traveling salesman problem with precedence constraints
0 references
0.903664231300354
0 references
0.87722247838974
0 references
