𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Generalized Model for Locating Facilities on a Network with Flow-Based Demand

✍ Scribed by Weiping Zeng; Ignacio Castillo; M. John Hodgson

Publisher
Springer US
Year
2008
Tongue
English
Weight
521 KB
Volume
10
Category
Article
ISSN
1566-113X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A general model for the undesirable sing
A general model for the undesirable single facility location problem
✍ J.J. SaameΓ±o RodrΓ­guez; C. Guerrero GarcΓ­a; J. MuΓ±oz PΓ©rez; E. MΓ©rida Casermeiro πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 408 KB

In this paper, a finite set in which an optimal solution for a general Euclidean problem of locating an undesirable facility in a polygonal region, is determined and can be found in polynomial time. The general problem we propose leads us, among others, to several well-known problems such as the max

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