Paper Info
Title
Discrete cooperative covering problems.
Abstract
A family of discrete cooperative covering problems is analysed in this paper. Each facility emits a signal that decays by the distance and each demand point observes the total signal emitted by all facilities. A demand point is covered if its cumulative signal exceeds a given threshold. We wish to maximize coverage by selecting locations for p facilities from a given set of potential sites. Two other problems that can be solved by the max-cover approach are the equivalents to set covering and p-centre problems. The problems are formulated, analysed and solved on networks. Optimal and heuristic algorithms are proposed and extensive computational experiments reported. Journal of the Operational Research Society (2011) 62, 2002-2012. doi:10.1057/jors.2010.176 Published online 15 December 2010
Year
DOI
Venue
2011
10.1057/jors.2010.176
JORS
Keywords
Field
DocType
heuristic algorithm,cumulant,set cover,computer experiment
Heuristic,Scheduling (computing),Computer science,Facility location problem,Purchasing,Operations management,Management science,Covering problems,Project management
Journal
Volume
Issue
ISSN
62
11
0160-5682
Citations 
PageRank 
References 
7
0.62
5
Authors
3
Name
Order
Citations
PageRank
O. Berman11604231.36
Zvi Drezner21195140.69
Dmitry Krass348382.08