Article1991

A Comparison of Two Heuristic Methods for the p‐Median Problem with and without Maximum Distance Constraints

Unknown author

17 citations0/0 files storedInternational Journal of Operations & Production Management

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 Vehicle Routing Optimization Methods Optimization and Mathematical Programming

Abstract

The performance of Ardalan′s heuristic is compared with that of Teitz and Bart for the location of service facilities, where performance is assessed in terms of the accuracy of solutions. The comparison is made considering two kinds of location problem:p‐median andp‐median with maximum distance constraints. The results indicate that the Teitz and Bart method generally produces a better solution than the Ardalan method for both problems.

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

References

1964Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph 1971The Location of Emergency Service Facilities 1970Central Facilities Location 1977Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms 1983Distance and the utilization of health facilities in rural Nigeria 1964On the Location of Supply Points to Minimize Transport Costs 1970An Analysis of Private and Public Sector Location Models 1977Technical Note—An Algorithm for the p-Median 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.