Conditional p -Center Problems

Zvi Drezner
Additional contact information
Zvi Drezner: California State University, Fullerton, California 92634

Transportation Science, 1989, vol. 23, issue 1, 51-53

Abstract: It is shown that conditional p -center problems can be solved by solving O (log n ) p -center problems where n is the number of demand points. Therefore, once an efficient algorithm exists for the p -center problem (by any metric or on a network), then an efficient one can be built for the conditional version of the problem.

Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.23.1.51 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:23:y:1989:i:1:p:51-53

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().