Abstract
ABSTRACTThe military uses direction finders to locate enemy forces by detecting the positions of transmitters that emit radio frequencies. We consider the problem of deploying the minimum number of direction finders to effectively cover an area of interest in which transmitters are likely to be positioned. Emissions may not be detectable if obstacles block the direct line of sight between a direction finder and the transmitter. We formulate this problem as a partial set multicover problem in which at least a p-fraction of the likely transmitter positions must be covered, each by at least k direction finders. We present a set of greedy heuristics with random selection rules for the partial set multicover problem. We perform computational tests to evaluate and compare these heuristics, both on randomly generated instances and a realistic instance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Management Science and Engineering Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
