Article1994

Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?

20 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 Computational Geometry and Mesh Generation Optimization and Mathematical Programming

Abstract

This paper discusses the problem of locating a single obnoxious or undesirable facility so as to maximize its rectilinear distance from a given set of existing facilities. An outline of published linear programming methods is given. Based on these ideas we present an algorithm which exploits known properties of the optimal solution and does not use linear programming at all.

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

References

1983THE LOCATION OF AN OBNOXIOUS FACILITY WITH RECTANGULAR DISTANCES*1986An Enhancement of the Drezner—Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance

Cited by

1999Integrating environmental issues into the mainstream: an agenda for research in operations management 2007An interactive solution approach for a bi-objective semi-desirable location problem 2002Vibrational Genetic Algorithm (Vga) for Solving Continuous Covering Location Problems

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.