Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem (Q3885528)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3691073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem |
scientific article; zbMATH DE number 3691073 |
Statements
Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem (English)
0 references
1980
0 references
asymmetric assignment problem
0 references
equivalent problem transformation
0 references
calculation of lower bounds
0 references
symmetric traveling salesman problems
0 references
assignment algorithms
0 references
distance matrix
0 references
assignment relaxation
0 references
