✦ LIBER ✦

The facility location problem when the underlying distribution is either dominated or dominating

✍ Scribed by A. Mehrez; A. Stulman

Publisher: Springer
Year: 1984
Tongue: English
Weight: 192 KB
Volume: 28
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01920506

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the solution of the facility location

On the solution of the facility location problem when the dominance method fails

✍ H. Frick 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 163 KB

Minimizing the size of an identifying or

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

✍ Irène Charon; Olivier Hudry; Antoine Lobstein 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Let G = (V; E) be an undirected graph and C a subset of vertices. If the sets Br(v) ∩ C, v ∈ V (respectively, v ∈ V \C), are all nonempty and di erent, where Br(v) denotes the set of all points within distance r from v, we call C an r-identifying code (respectively, an r-locating-dominating code). W