𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving Nonlinear Single-Facility Network Location Problems

✍ Scribed by John Hooker

Book ID
123687085
Publisher
INFORMS
Year
1986
Tongue
English
Weight
428 KB
Volume
34
Category
Article
ISSN
0030-364X

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

Single-facility huff location problems o
Single-facility huff location problems on networks
✍ Blanquero, Rafael; Carrizosa, Emilio; Nogales-GΓ³mez, Amaya; Plastria, Frank πŸ“‚ Article πŸ“… 2013 πŸ› Springer US 🌐 English βš– 770 KB
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