Branch-and-bound algorithm for symmetric travelling salesman problem (Q1671016)
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: Branch-and-bound algorithm for symmetric travelling salesman problem |
scientific article; zbMATH DE number 6932713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-bound algorithm for symmetric travelling salesman problem |
scientific article; zbMATH DE number 6932713 |
Statements
Branch-and-bound algorithm for Symmetric Travelling Salesman problem (English)
0 references
6 September 2018
0 references
Traveling Salesman problem
0 references
1-tree
0 references
branch-and-bound algorithm
0 references
0.8696814775466919
0 references
0.828791081905365
0 references
0.8274891972541809
0 references
0.8215098977088928
0 references
