1 citations · 1 across the 5 of their papers we have counts for
Showing 2025 · math.OCShow all
2 papers · 2 filters
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…