The travelling salesman problem as a constrained shortest path problem: Theory and computational experience (Q1146121)
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: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience |
scientific article; zbMATH DE number 3698750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The travelling salesman problem as a constrained shortest path problem: Theory and computational experience |
scientific article; zbMATH DE number 3698750 |
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
