An algorithm for the \(M\) asymmetric travelling salesman problem on a bandwidth-limited graph (Q3991499)
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: An algorithm for the \(M\) asymmetric travelling salesman problem on a bandwidth-limited graph |
scientific article; zbMATH DE number 37078
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the \(M\) asymmetric travelling salesman problem on a bandwidth-limited graph |
scientific article; zbMATH DE number 37078 |
Statements
28 June 1992
0 references
polynomial dynamic programming
0 references
travelling salesman
0 references
directed bandwidth- limited graph
0 references