✦ LIBER ✦

Minimax regret path location on trees

✍ Scribed by Justo Puerto; Federica Ricca; Andrea Scozzari

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 241 KB
Volume: 58
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20453

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimax trees, paths, and cut sets

✍ H. W. Corley; H. Golnabi 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

Minmax-regret robust 1-median location o

Minmax-regret robust 1-median location on a tree

✍ Chen, Bintong; Lin, Chin-Shien 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

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 de

Minimax and maximin facility location pr

Minimax and maximin facility location problems on a sphere

✍ Zvi Drezner; George O. Wesolowsky 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB 👁 1 views

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

Locating median paths on connected outer

Locating median paths on connected outerplanar graphs

✍ Isabella Lari; Federica Ricca; Andrea Scozzari; Ronald I. Becker 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB 👁 1 views

The continuous and discrete path-varianc

The continuous and discrete path-variance problems on trees

✍ Justo Puerto; Federica Ricca; Andrea Scozzari 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB