Article1984

The Planar Two-Center and Two-Median Problems

121 citations0/0 files storedTransportation Science

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 Computational Geometry and Mesh Generation

Abstract

We present algorithms for the solution of planar location-allocation problems with two new facilities. Euclidean distances are assumed. We address both the minimax (or “two-center”), and minisum (or “two-median”) problems. Computational results are presented.

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

References

1963Location-Allocation Problems 1964Heuristic Methods for Location-Allocation Problems 1972Geometrical Solutions for Some Minimax Location Problems 1972The Transportation-Location Problem

Cited by

2002Continuous Covering Location Problems 1992An optimal method for solving the (generalized) multi-Weber problem 2007A Survey of Solution Methods for the Continuous Location-Allocation Problem 2016A multi-objective model for locating search and rescue boats 2017An iterative solution approach to a multi-objective facility location problem 1995Dynamic facility location: The progressive p-median problem 2003A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem 1987On the rectangularp-center problem

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.