An Algorithm for the M-Median Plant Location Problem

Robert Garfinkel · Alan W. Neebe · M. R. Rao

89 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 Vehicle Routing Optimization Methods

Abstract

The problem is to locate a given number of plants along a road network so as to minimize the total distance between plants and warehouses assigned to them. It is modeled as an integer programming problem and the relaxed LP is solved by decomposition. In cases of noninteger termination, the ILP is attacked using group theoretics and a dynamic programming recursion. Computational results are given, which contrast this procedure to a branch-and-bound approach.

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 1970Central Facilities Location 1971Optimal Center Location in Simple Networks 1964On the Location of Supply Points to Minimize Transport Costs 1970An Analysis of Private and Public Sector Location Models 1970Optimal Political Districting by Implicit Enumeration Techniques

Cited by

1980A Dual-Bounded Algorithm for the p-Median Problem 2006A branch-and-price algorithm for the capacitated facility location problem 1979A Note Comparing Optimal and Heuristic Solutions To the p‐Median Problem 2004A branch-and-price approach to p-median location problems 1999A gamma heuristic for the p-median problem 1982Locating mobile servers on a network with markovian properties 2003Branch and peg algorithms for the simple plant location problem 1980Locational Decisions on Stochastic Networks

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.