Parallel complexity of additive location problems

Authors
Averbakh, I Berman, O
Citation
I. Averbakh et O. Berman, Parallel complexity of additive location problems, INFORMS J C, 11(3), 1999, pp. 292-298
Citations number
13
Categorie Soggetti
Computer Science & Engineering
Journal title
INFORMS JOURNAL ON COMPUTING
ISSN journal
10919856 → ACNP
Volume
11
Issue
3
Year of publication
1999
Pages
292 - 298
Database
ISI
SICI code
1091-9856(199922)11:3<292:PCOALP>2.0.ZU;2-8
Abstract
Parallel NC-algorithms far a general class of multifacility location proble ms on a free with identical facilities and the minisum objective function a re presented. The class includes the p-median problem, the p-coverage probl em, and the uncapacitated plant location problem.