An exact algorithm for the clustered travelling salesman problem (Q505157)
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 6676252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the clustered travelling salesman problem |
scientific article; zbMATH DE number 6676252 |
Statements
An exact algorithm for the clustered travelling salesman problem (English)
0 references
19 January 2017
0 references
clustered travelling salesman problem
0 references
exact
0 references
optimal
0 references
lexisearch algorithm
0 references
bound
0 references
0 references
0 references
0 references
0.8530155420303345
0 references
0.8223344683647156
0 references
0.8212476372718811
0 references
0.8166290521621704
0 references
0.813174307346344
0 references
