Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming (Q4294336): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q439613 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Lucio Bianco / rank | |||
Normal 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.1080/03155986.1994.11732235 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W436551700 / rank | |||
Normal rank |
Latest revision as of 02:15, 20 March 2024
scientific article; zbMATH DE number 572302
Language | Label | Description | Also known as |
---|---|---|---|
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