Algorithms for the minimax problem of the travelling salesman. II: Dual approach (Q1285427)
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 travelling salesman. II: Dual approach |
scientific article; zbMATH DE number 1279868
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the minimax problem of the travelling salesman. II: Dual approach |
scientific article; zbMATH DE number 1279868 |
Statements
Algorithms for the minimax problem of the travelling salesman. II: Dual approach (English)
0 references
5 August 1999
0 references
minimax problem
0 references
traveling salesman
0 references
branch-and-bound
0 references
