Premium
Probabilistic partial set covering problems
Author(s) -
Sherali Hanif D.,
Kim SeongIn,
Parrish Edna L.
Publication year - 1991
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199102)38:1<41::aid-nav3220380106>3.0.co;2-l
Subject(s) - mathematical optimization , set (abstract data type) , probabilistic logic , constraint (computer aided design) , computer science , reliability (semiconductor) , branch and bound , order (exchange) , service (business) , set cover problem , operations research , mathematics , artificial intelligence , programming language , power (physics) , physics , geometry , economy , finance , quantum mechanics , economics
In this article, we consider a situation in which a group of facilities need to be constructed in order to serve a given set of customers. However, the facilities cannot guarantee an absolute coverage to any of the customers. Hence, we formulate this problem as one of maximizing the total service reliability of the system subject to a budgetary constraint. For this problem, we develop and test suitable branch‐and‐bound algorithms and study the effect of problem parameters on solution difficulty. Some generalizations of this problem are also mentioned as possible extensions.