✦ LIBER ✦

Minmax-regret robust 1-median location on a tree

✍ Scribed by Chen, Bintong; Lin, Chin-Shien

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 171 KB
Volume: 31
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199803)31:2<93::aid-net4>3.0.co;2-e

No coin nor oath required. For personal study only.

✦ Synopsis

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 derived. Using these properties, efficient algorithms are developed for finding the minmax-regret 1median locations for both cases. An example is provided to illustrate the algorithm.

📜 SIMILAR VOLUMES

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

Robust location problems with pos/neg we

Robust location problems with pos/neg weights on a tree

✍ Rainer E. Burkard; Helidon Dollani 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 1 views