A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem (Q1281074)
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 1263152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem |
scientific article; zbMATH DE number 1263152 |
Statements
A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem (English)
0 references
29 June 1999
0 references
ascent algorithms
0 references
symmetric traveling salesman
0 references
branch-and-bound
0 references
0.8487440347671509
0 references
0.8344555497169495
0 references
0.8279979825019836
0 references
0.8275651931762695
0 references
0.8176521062850952
0 references
