67 citations · 74 across the 30 of their papers we have counts for
32 papers
Enhancing Presolve in Mixed Integer Programming by Combining Probing and Dual Fixing
Zhao-Wei Wang, Wei-Kun Chen, Yu-Hong Dai
Probing and dual fixing are two powerful presolve techniques in mixed integer programming (MIP) solvers. Probing tentatively sets some binary variables to 0 or 1, applies linear co…
Exploiting Variable Implications in Presolve for Mixed Integer Programming
Wei-Kun Chen, Chang-Long Li, Zhao-Wei Wang +3
Presolve for mixed integer programming (MIP) problems aims to eliminate redundant information, strengthen the formulation, and extract useful structural information for the subsequ…
Polyhedral results for two classes of submodular sets with GUB constraints
Weikang Qian, Keyan Li, Wei-Kun Chen +1
In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real…
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 fun…
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…