Article1983

Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network

36 citations0/0 files storedOperations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Complexity and Algorithms in Graphs Optimization and Mathematical Programming

Abstract

This paper investigates a class of single-facility location problems on an arbitrary network. Necessary and sufficient conditions are obtained for characterizing locally optimal locations with respect to a certain nonlinear objective function. This approach produces a number of new results for locating a facility on an arbitrary network, and in addition it unifies several known results for the special case of tree networks. It also suggests algorithmic procedures for obtaining such optimal locations.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 36 citations exist upstream.

References

1964Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph 1971Optimal Center Location in Simple Networks 1979Location on Networks: Theory and Algorithms 1974A Minimax Location Problem on a Network 1977A Min-Max Theorem for p-Center Problems on a Tree 1967Letter to the Editor—Some Aspects of a Minimax Location Problem 1970Letter to the Editor—A Localization Theorem for Optimal Facility Placement 1980Localizing 2‐medians on probabilistic and deterministic tree networks

Cited by

1987Single Facility Location on Networks

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.