Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming (Q1285454): 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:49, 5 March 2024
scientific article
| 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 |
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
