67 citations · 74 across the 30 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.OC2025
An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
Yan-Ru Wang, Wei-Kun Chen, Ivana Ljubić
In this paper, we consider the multiple probabilistic covering location problem (MPCLP), which attempts to open a fixed number of facilities to maximize the total covered customer…
math.OC2025
An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
Yu-Qi Guo, Yan-Ru Wang, Wei-Kun Chen +1
We investigate the sequential competitive facility location problem (SCFLP) under partially binary rule where two companies sequentially open a limited number of facilities to maxi…
math.OC2025
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…