𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving nonlinear multiple-facility network location problems

✍ Scribed by J. N. Hooker

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
751 KB
Volume
19
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

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 number of servers with locations fixed beforehand. The classical p-median, p-center, and p-facility cent-dian problems are special cases. Other problems of this form include a large number of obnoxious facility problems, problems in which the objective is to minimize an LA norm of distances, and a wide variety of problems in which equity or social welfare is a factor.

πŸ“œ SIMILAR VOLUMES

Solving the dynamic facility location pr
Solving the dynamic facility location problem
✍ Chardaire, Pierre; Sutter, Alain; Costa, Marie-Christine πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 559 KB

This paper addresses with the multiperiod, or dynamic, uncapacited facility location problem (DUFLP): The demand varies between time periods and the solution should answer the questions of where and when to establish facilities. We modelize the problem as a 0-1 quadratic program and, since the DUFL

Solving the hub location problem in a st
Solving the hub location problem in a star–star network
✍ Martine LabbΓ©; Hande Yaman πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 273 KB πŸ‘ 1 views

## Abstract We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals a