Minmax \(p\)-traveling salesmen location problems on a tree (Q1872012)
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: Minmax p-traveling salesmen location problems on a tree |
scientific article; zbMATH DE number 1904005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minmax \(p\)-traveling salesmen location problems on a tree |
scientific article; zbMATH DE number 1904005 |
Statements
Minmax \(p\)-traveling salesmen location problems on a tree (English)
0 references
4 May 2003
0 references
polynomial algorithm
0 references
location
0 references
traveling salesman problem
0 references
0.94949174
0 references
0.93003154
0 references
0.92825377
0 references
0.92643464
0 references
0.92128366
0 references
0.9080339
0 references
0.8960103
0 references
0.88688564
0 references
0.8863876
0 references
