Article1978

A New Method for the Multifacility Minimax Location Problem

38 citations0/0 files storedJournal of the Operational Research Society

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 presents a new method of locating n new facilities among m destinations in accordance with the minimax criterion; that is, the facilities are located to minimize the maximum weighted distance in the system. Distances may be rectangular, Euclidean, or general (lp). The method involves the numerical integration of ordinary differential equations and is computationally superior to methods using nonlinear programming.

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

References

1991Facility Layout and Location: An Analytical Approach 1976Minimax Multifacility Location with Euclidean Distances 1974A Network Flow Solution to a Multifacility Minimax Location Problem Involving Rectilinear Distances 1972Rectangular Distance Location under the Minimax Optimality Criterion

Cited by

2019Planning Emergency Shelters for Urban Disasters: A Multi-Level Location–Allocation Modeling Approach 1984Location problems with costs being sums of powers of euclidean distances 1983Constrained Location Problems in the Plane and on a Sphere 1982A Trajectory Approach to the Round-Trip Location 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.