A new extension principle algorithm for the traveling salesman problem (Q3962804)
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 3784660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new extension principle algorithm for the traveling salesman problem |
scientific article; zbMATH DE number 3784660 |
Statements
A new extension principle algorithm for the traveling salesman problem (English)
0 references
1982
0 references
extension principle algorithm
0 references
branch-and-bound
0 references
algorithm
0 references
asymmetric traveling salesman problem
0 references
randomly generated test problems
0 references
computational tests
0 references
computation of lower bounds
0 references
assignment problem relaxation
0 references
