𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Location of an obnoxious facility on a network: A voting approach

✍ Scribed by Martine Labbé

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
494 KB
Volume
20
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum covering criterion for obnoxious
Minimum covering criterion for obnoxious facility location on a network
✍ Berman, Oded; Drezner, Zvi; Wesolowsky, George O. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB 👁 1 views

The objective of this article was to find a location of a new facility on a network so that the total number (weight) of nodes within a prespecified distance R is minimized. This problem is applicable when locating an obnoxious facility such as garbage dumps, nuclear reactors, prisons, and military

On the location of a tree-shaped facilit
On the location of a tree-shaped facility
✍ Kim, Tae Ung; Lowe, Timothy J.; Tamir, Arie; Ward, James E. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 769 KB

This paper considers the problem of locating a central facility on a tree network. The central facility takes the form of a subtree of the network and provides service to several demand points located at the nodes of the network. Two types of costs are involved in evaluating a given facility selecti

Locating replicas of a database on a net
Locating replicas of a database on a network
✍ Hakimi, S. Louis; Schmeichel, Edward F. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 1 views

We study the problem of locating replicas of a database on a network to minimize the communication cost. We first present extensions of the p-median theorem to prove that under two different measures of communication cost one can always optimally locate the replicas at the vertices (nodes) of the ne

Heuristics for the location of inspectio
Heuristics for the location of inspection stations on a network
✍ Michel Gendreau; Gilbert Laporte; Isabelle Parent 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 385 KB 👁 1 views

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin-destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the tota

Trade-offs on the location of the core n
Trade-offs on the location of the core node in a network
✍ Jean-François Macq; Michel X. Goemans 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. We characterize the worst‐case t