The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
An Overview on Set Covering Problems With a Focus on Military Applications
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.
Related Content
|
Azeem Khan, Noor Zaman Jhanjhi, Haji Abdul Hafidz B. Haji Omar, Dayang Hajah Tiawa B. Awang Haji Hamid.
© 2024.
35 pages.
|
|
Brendan Ooi Tze Wen, Najihah Syahriza, Nicholas Chan Wei Xian, Nicki Gan Wei, Tan Zheng Shen, Yap Zhe Hin, Siva Raja Sindiramutty, Teah Yi Fan Nicole.
© 2024.
39 pages.
|
|
Sidra Tahir, Anam Zaheer.
© 2024.
17 pages.
|
|
Tayyab Rehman, Noshina Tariq, Muhammad Ashraf, Mamoona Humayun.
© 2024.
24 pages.
|
|
Noshina Tariq, Tehreem Saboor, Muhammad Ashraf, Rawish Butt, Masooma Anwar, Mamoona Humayun.
© 2024.
25 pages.
|
|
Sidra Tahir.
© 2024.
15 pages.
|
|
Siva Raja Sindiramutty, Noor Zaman Jhanjhi, Chong Eng Tan, Navid Ali Khan, Bhavin Shah, Loveleen Gaur.
© 2024.
68 pages.
|
|
|