𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A minmax regret median problem on a tree under uncertain locations of the demand points

✍ Scribed by Conde, Eduardo


Book ID
121016455
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
272 KB
Volume
41
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


An improved algorithm for the minmax reg
✍ 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