Fast and robust techniques for the euclidean p-median problem with uniform weights

Authors:
G. J. Lim;J. Reese;A. Holder
Affiliations:
Department of Industrial Engineering, University of Houston, 4800 Calhoun Road, Houston, TX 77204, United States;PROS Revenue Management, Houston, TX, United States;Department of Mathematics, Rose-Hulman Institute of Technology, 5500 Wabash Ave, Terre Haute, IN 47803, United States
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 2
Cited 1

Solution methods for the p-median problem: An annotated bibliography

Networks
Least squares quantization in PCM

IEEE Transactions on Information Theory

GPU-based parallel vertex substitution algorithm for the p-median problem

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss new solution techniques for the p-median problem, with the goal being to improve the solution time and quality of current techniques. In particular, we hybridize the discrete Lloyd algorithm and the vertex substitution heuristic. We also compare three starting point techniques and present a new solution method that provides consistently good results when appropriately initialized.