𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On exact solutions for the Minmax Regret Spanning Tree problem

✍ Scribed by Pérez-Galarce, Francisco; Álvarez-Miranda, Eduardo; Candia-Véjar, Alfredo; Toth, Paolo

Book ID
122227060
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
339 KB
Volume
47
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

📜 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