Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2 (Q3115668)
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: Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2 |
scientific article; zbMATH DE number 6004931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for solving the 2-peripatetic salesman problem on a complete graph with edge weights 1 and 2 |
scientific article; zbMATH DE number 6004931 |
Statements
10 February 2012
0 references
approximation algorithm
0 references
well-solved case
0 references
branch and bound algorithm
0 references
0.940091907978058
0 references
0.9362850785255432
0 references
0.9004226326942444
0 references
0.870978593826294
0 references
