A large-scale application of the partial coverage uncapacitated facility location problem

Set covering problem with conflict constraints

“…Its goal is to find a subset of columns that cover all rows of a zero-one matrix at minimal cost. The SCP has numerous real-life applications including those involving crew scheduling [21,4,46,39], facility location [9,1,61,74,73], vehicle routing [64,19], selection of portfolio [54], and conservation biology [49]. Various algorithms are proposed for solving this problem.…”

Uncapacitated facility location problem with self-serving demands

“…Let ∈ L. Since (x, y, z) is feasible, then from (3), there is an index j ∈ J + such that x j is one and (16) implies that (v − c j ) − = 0, i.e. v ≥ c j .…”

“…They give conditions under which the region has integral vertices. Vasko et al [16] introduced this model as partial coverage UFLP and investigated some large scale applications in inventory sizing. They also show that this problem simply could be converted to a UFLP.…”