✦ LIBER ✦

Polyhedral Properties of theK-median Problem on a Tree

✍ Scribed by Sven de Vries; Marc E. Posner; Rakesh V. Vohra

Book ID: 106275596
Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 267 KB
Volume: 110
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-006-0002-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The inverse 1-median problem on a tree a

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

✍ Mohammadreza Galavii 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 201 KB

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

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

On the Steiner median of a tree

✍ Lowell W. Beineke; Ortrud R. Oellermann; Raymond E. Pippert 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 639 KB

Network location problems with continuou

Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree

✍ Tom M. Cavalier; Hanif D. Sherali 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 907 KB

A polynomial method for the pos/neg weig

A polynomial method for the pos/neg weighted 3-median problem on a tree

✍ Rainer E. Burkard; Jafar Fathali 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 212 KB