4 papers
Towards large-scale probabilistic set covering problems: an efficient Benders decomposition approach
Wei Lv, Wei-Kun Chen, Yi-Long Chen +1
In this paper, we investigate the probabilistic set covering problem (PSCP) in which the right-hand side is a binary random vector and the covering constraint is required to be sat…
Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
Wei Lv, Wei-Kun Chen, Yu-Hong Dai +1
We consider the chance-constrained program (CCP) with random right-hand side under a finite discrete distribution. It is known that the standard mixed integer linear programming (M…
Presolving and cutting planes for the generalized maximal covering location problem
Wei Lv, Cheng-Yang Yu, Jie Liang +2
This paper considers the generalized maximal covering location problem (GMCLP) which establishes a fixed number of facilities to maximize the weighted sum of the covered customers,…
Benders decomposition for the large-scale probabilistic set covering problem
Jie Liang, Cheng-Yang Yu, Wei Lv +2
In this paper, we consider a probabilistic set covering problem (PSCP) in which each 0-1 row of the constraint matrix is random with a finite discrete distribution, and the objecti…