5 papers · 1 filter
On strong valid inequalities for a class of mixed-integer nonlinear sets with box constraints
Keyan Li, Yan-Ru Wang, Wei-Kun Chen +1
In this paper, we investigate the mixed-integer nonlinear set with box constraints , where is a univariate concave fu…
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…
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…
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…
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…