A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems

R.A. Whitaker

186 citations0/0 files storedINFOR Information Systems and Operational Research

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

A fast algorithm is described for implementing the greedy interchange heuristic for lise in solving large scale clustering and uncapacitated median location problems. Computational experience is reported for these algorithms on a number of large randomly generated networks and on some difficult problem sets, and comparisons with some other implementations are made. An additional heuristic is proposed for solving these set partitioning problems based on an efficient procedure for achieving the interchange.

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

References

1978A Dual-Based Procedure for Uncapacitated Facility Location 1977Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms 1976A Heuristic Program for Locating Warehouses 1963A Heuristic Program for Locating Warehouses 1976Theoretical and Computational Links between the p‐Median, Location Set‐covering, and the Maximal Covering Location Problem

Cited by

2010Optimization of preventive health care facility locations 1989On the exact solution of large-scale simple plant location problems 2003Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search 2002Location Problems in the Public Sector 2005Solving the uncapacitated facility location problem using tabu search 1998Heuristic solution of the multisource Weber problem as a p-median problem 1989A method for solving to optimality uncapacitated location problems 2007A Survey of Solution Methods for the Continuous Location-Allocation 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.