This paper considers the problem of placing suicide bomber detectors. The model takes into account the probability that a given detector may fail to detect bombers. In brief, the model assumes a layout of squares, some of which are blocked and some of which correspond to entry points to the area being monitored. The detectors are assumed to be capable of detecting a bomber within a certain distance with a given probability. The model considers the paths that a suicide bomber might take from an entrance square to the target square in which detonation could take place. The goal is to place a fixed number of detectors in order to minimize the possible number of casualties. Some squares can be eliminated from consideration as detector locations because they are "dominated" by other squares, that is, other squares cover the same paths as the dominated square.
展开▼
