New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems

Authors:
Doron Chen;Reuven Chen
Affiliations:
IBM Haifa Research Lab, Tel-Aviv Site, Israel;Raymond and Beverly Sackler School of Physics and Astronomy, Tel-Aviv University, Tel-Aviv 69978, Israel
Venue:
Computers and Operations Research
Year:
2009

Citing 2
Cited 3

Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)
A New Formulation and Resolution Method for the p-Center Problem

INFORMS Journal on Computing

Bee colony optimization for the p-center problem

Computers and Operations Research
A relaxation-based algorithm for solving the conditional p-center problem

Operations Research Letters
Robust vertex p-center model for locating urgent relief distribution centers

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present new relaxation algorithms for the uncapacitated continuous and discrete p-center problems. We have conducted an experimental study that demonstrated that these new algorithms are extremely efficient.