An Overview on Set Covering Problems With a Focus on Military Applications

This chapter deals with the set covering problem, a specific type of a discrete location and representative combinatorial optimization problem, which occupies a huge space in military operations research with its various applications. After presenting a brief literature survey of set covering problems, the author provides a formal description and the mathematical model of the problem. Finally, the key position of those problem types in the military domain and with real-world applications is discussed.