Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming (Q1285454)
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: Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming |
scientific article; zbMATH DE number 1279888
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming |
scientific article; zbMATH DE number 1279888 |
Statements
Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming (English)
0 references
26 April 1999
0 references
minimax problem
0 references
traveling salesman
0 references
multistep control process
0 references
dynamic programming
0 references
