An Extended Theorem for Location on a Network

Abstract

The aim of this paper is twofold: (1) to offer another proof of the theorem, established by S. L. Hakimi, in which it was shown that the optimal locations of uncapacitated centres on a linear graph are always at the nodes of the graph; (2) to extend the result to the case of concave, and not necessarily identical, transportation cost functions and to centres with capacity restrictions.

Cite this work

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

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

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