𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the minmax regret centdian location on trees

✍ Scribed by Eduardo Conde

Book ID
103877835
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
149 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minmax-regret robust 1-median location o
Minmax-regret robust 1-median location on a tree
✍ Chen, Bintong; Lin, Chin-Shien πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 171 KB

This paper considers the minmax-regret 1-median problem on a tree network where edge lengths and node weights are uncertain and the uncertainty is characterized by given intervals. Some localization properties for the optimal locations, for both the node-restricted and the unrestricted cases, are de

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because