A new extension principle algorithm for the traveling salesman problem (Q3962804): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 14:41, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new extension principle algorithm for the traveling salesman problem |
scientific article |
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