Error-bound driven demand point aggregation for the rectilinear distance p-center model

M. Brenda Rayco; Richard L. Fancis; Timothy J. Lowe

doi:10.1016/s0966-8349(97)00006-5

Back

Journal article

Error-bound driven demand point aggregation for the rectilinear distance p-center model

M. Brenda Rayco, Richard L. Fancis and Timothy J. Lowe

Location science, Vol.4(4), pp.213-235

12/01/1996

DOI: 10.1016/s0966-8349(97)00006-5

View Online

Abstract

We present an algorithm for aggregating demand points for the rectilinear distance p-center problem. We solve, to optimality, two "projected" problems and then combine the solutions. The maximum objective function error between true and aggregated problems can be well predicted prior to solving the aggregated problem. We also report on our computational experience. © 1997 Elsevier Science Ltd.

Aggregation

p-center

Details

Title: Subtitle: Error-bound driven demand point aggregation for the rectilinear distance p-center model
Creators: M. Brenda Rayco - University of Florida
Richard L. Fancis - University of Florida
Timothy J. Lowe - University of Iowa
Resource Type: Journal article
Publication Details: Location science, Vol.4(4), pp.213-235
DOI: 10.1016/s0966-8349(97)00006-5
ISSN: 0966-8349
Number of pages: 23
Language: English
Date published: 12/01/1996
Academic Unit: Business Analytics
Record Identifier: 9984963197602771

Metrics

4 Record Views