An improved algorithm for the minmax regret median problem on a tree (Q4804168)
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 1896659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for the minmax regret median problem on a tree |
scientific article; zbMATH DE number 1896659 |
Statements
An improved algorithm for the minmax regret median problem on a tree (English)
0 references
10 April 2003
0 references
minmax regret optimization
0 references
facility location
0 references
polynomial algorithms
0 references
0.9354875087738036
0 references
0.9293144941329956
0 references
0.9266943335533142
0 references
0.9186601638793944
0 references
0.917181134223938
0 references
