Affiliation:
1. Duzce University, Turkey
Abstract
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.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献