Optimum Locations on a Graph with Probabilistic Demands

H. Frank

89 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 Search Problems

Abstract

The traffic demands at the stations of a communication network are usually not deterministic. Optimum locations found using deterministic techniques are poor when the random nature of the network traffic is considered. The concepts of absolute centers and medians are generalized to maximum probability absolute centers and medians. Minimum variance points are also considered. Techniques to locate these optimum points are discussed.

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 — 89 citations exist upstream.

References

1964Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

Cited by

2000Minmax Regret Median Location on a Network Under Uncertainty 1990Locating an Ambulance on the Amherst Campus of the State University of New York at Buffalo 2000Algorithms for the robust 1-center problem on a tree 1974A Minimax Location Problem on a Network 1985‘Multidimensional’ extensions and a nested dual approach for the m-median problem 1974Technical Note—Location Theory: A Selective Bibliography 2015Facility Location Under Uncertainty 2003A competitive facility location problem on a tree network with stochastic weights

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.