Solving Nonlinear Single-Facility Network Location Problems

John Hooker
Additional contact information
John Hooker: Carnegie-Mellon University, Pittsburgh, Pennsylvania

Operations Research, 1986, vol. 34, issue 5, 732-743

Abstract: We present a general approach to solving nonlinear single-facility network location problems. We assume that cost is any convex function of distances, and solve this class of problem by solving convex subproblems on “treelike segments” into which the network is decomposed. We show that only a fraction of treelike segments generally need be examined, and that our method results in a reasonably efficient general-purpose algorithm. The algorithm is particularly effective on real-world (as opposed to random) networks, and when the cost function is nondecreasing and “semiseparable,” as are many popular cost functions. Finally, we describe theoretical complexity bounds and computational experience.

Keywords: 185; 481 location on networks (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.5.732 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:34:y:1986:i:5:p:732-743

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().