A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree (Q1917344)
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 897431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree |
scientific article; zbMATH DE number 897431 |
Statements
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree (English)
0 references
5 August 1996
0 references
two tavelling salesmen
0 references
NP-hard
0 references
heuristic
0 references
worst-case relative error
0 references
0.8779691457748413
0 references
0.8573993444442749
0 references
0.8193840980529785
0 references
0.8181795477867126
0 references
0.7921344637870789
0 references
