3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417)
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 6111690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem |
scientific article; zbMATH DE number 6111690 |
Statements
3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (English)
0 references
30 November 2012
0 references
traveling salesman problem
0 references
heterogeneous vehicle
0 references
0 references
0 references
0.8604925870895386
0 references
0.8483731150627136
0 references
0.8398897647857666
0 references
0.8396458625793457
0 references
0.8369575142860413
0 references
