The Round-Trip <i>p</i>-Center and Covering Problem on a Tree (Q3745587)
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 3980870
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Round-Trip <i>p</i>-Center and Covering Problem on a Tree |
scientific article; zbMATH DE number 3980870 |
Statements
The Round-Trip <i>p</i>-Center and Covering Problem on a Tree (English)
0 references
1985
0 references
round-trip p-center problem
0 references
minimize the maximum round-trip cost
0 references
round- trip covering problem
0 references
tree
0 references
strong duality result
0 references
polynomial time
0 references
0.8592737317085266
0 references
0.8572759032249451
0 references
0.8307048082351685
0 references
