12 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…
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…
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…
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 fu…