✦ LIBER ✦

The inverse 1-median problem on a tree and on a path

✍ Scribed by Mohammadreza Galavii

Book ID: 108120793
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 201 KB
Volume: 36
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2010.05.157

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The bi-criteria doubly weighted center-m

The bi-criteria doubly weighted center-median path problem on a tree

✍ J. Puerto; A.M. Rodríguez-Chía; A. Tamir; D. Pérez-Brito 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

Inverse 1-median problem on trees under

Inverse 1-median problem on trees under weighted Hamming distance

✍ Xiucui Guan, Binwu Zhang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 171 KB

Finding the conditional location of a me

Finding the conditional location of a median path on a tree

✍ Biing-Feng Wang; Tzu-Chin Lin; Chien-Hsin Lin; Shan-Chyun Ku 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Inverse Center Location Problem on a Tre

Inverse Center Location Problem on a Tree

✍ Xiaoguang YANG; Jianzhong ZHANG 📂 Article 📅 2008 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 288 KB

Polyhedral Properties of theK-median Pro

Polyhedral Properties of theK-median Problem on a Tree

✍ Sven de Vries; Marc E. Posner; Rakesh V. Vohra 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 267 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