The travelling salesman problem as a constrained shortest path problem: Theory and computational experience (Q1146121): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:21, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The travelling salesman problem as a constrained shortest path problem: Theory and computational experience |
scientific article |
Statements
The travelling salesman problem as a constrained shortest path problem: Theory and computational experience (English)
0 references
1980
0 references
travelling salesman problem
0 references
constrained shortest path problem
0 references
computational experience
0 references
n-path relaxation
0 references
optimal vertex penalties
0 references
branch and bound algorithm
0 references
