𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mixed planar/network facility location problems

✍ Scribed by Rajan Batta; Udatta S. Palekar

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
585 KB
Volume
15
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Solving nonlinear multiple-facility netw
Solving nonlinear multiple-facility network location problems
✍ J. N. Hooker πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 751 KB

We show how to locate optimally p new facilities (servers) on a network so as to minimize cost, where cost can be any convex function of the distances between demand points (nodes) and a closest server. The algorithm is generally practical only for small p (perhaps 2, 3, or 4), but it admits a large

Multicriteria planar location problems
Multicriteria planar location problems
✍ H.W. Hamacher; S. Nickel πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 1014 KB
Multi-criteria minisum facility location
Multi-criteria minisum facility location problems
✍ J. Puerto; F.R. FernΓ‘ndez πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 181 KB

This paper deals with the multi-criteria Weber (minisum) problem. Several new solution concepts are introduced, related to ideas of equilibrium between the different aspects covered by the objectives. Structural results are presented characterizing the proposed solution sets and showing the relation