𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Algorithm for the Traveler′s Problem

✍ Scribed by A. Aggarwal; T. Tokuyama

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
581 KB
Volume
19
Category
Article
ISSN
0196-6774

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