✦ LIBER ✦

A representation theorem for minmax regret policies

✍ Scribed by Sanjiang Li

Book ID: 103821326
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 121 KB
Volume: 171
Category: Article
ISSN: 0004-3702
DOI: 10.1016/j.artint.2006.11.001

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

On a constant factor approximation for m

On a constant factor approximation for minmax regret problems using a symmetry point scenario

✍ Eduardo Conde 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 287 KB

A 2-approximation for minmax regret prob

A 2-approximation for minmax regret problems via a mid-point scenario optimal solution

✍ Eduardo Conde 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A representation theorem for lattices

✍ B. M. Schein 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 121 KB

A representation theorem for quantales

✍ Carolyn Brown; Doug Gurr 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 920 KB

A tabu search algorithm for the minmax r

A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data

✍ Adam Kasperski, Mariusz Makuchowski, Paweł Zieliński 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 972 KB