67 citations · 74 across the 30 of their papers we have counts for
5 papers · 2 filters
Distributed Recursion Revisited
Wei-Yang Zhang, Feng-Lian Dong, Zhi-Wei Wei +4
The distributed recursion (DR) algorithm is an effective method for solving the pooling problem that arises in many applications. It is based on the well-known P-formulation of the…
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,…
An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
Wei-Kun Chen, Wei-Yang Zhang, Yan-Ru Wang +2
In the paper, we consider the competitive facility location problem with limited choice rule (CFLPLCR), which attempts to open a subset of facilities to maximize the net profit of…
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…
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…