65 citations · 75 across the 24 of their papers we have counts for
26 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 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…
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…
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…
QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks
Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai +1
In this paper, we consider the network slicing (NS) problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network inf…
Presolving and cutting planes for the generalized maximal covering location problem
Wei Lv, Cheng-Yang Yu, Jie Liang +2
This paper considers the generalized maximal covering location problem (GMCLP) which establishes a fixed number of facilities to maximize the weighted sum of the covered customers,…
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…
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…
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…
An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing
Wei-Kun Chen, Zheyu Wu, Rui-Jin Zhang +3
This paper considers the network slicing (NS) problem which attempts to map multiple customized virtual network requests to a common shared network infrastructure and allocate netw…
A Cut-and-solve Algorithm for Virtual Machine Consolidation Problem
Jiang-Yao Luo, Liang Chen, Wei-Kun Chen +2
The virtual machine consolidation problem (VMCP) attempts to determine which servers to be activated, how to allocate virtual machines (VMs) to the activated servers, and how to mi…
Efficient Quantized Constant Envelope Precoding for Multiuser Downlink Massive MIMO Systems
Zheyu Wu, Ya-Feng Liu, Bo Jiang +1
Quantized constant envelope (QCE) precoding, a new transmission scheme that only discrete QCE transmit signals are allowed at each antenna, has gained growing research interests du…
Optimal QoS-Aware Network Slicing for Service-Oriented Networks with Flexible Routing
Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai +1
In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastr…
Towards Efficient Large-Scale Network Slicing: An LP Dynamic Rounding-and-Refinement Approach
Wei-Kun Chen, Ya-Feng Liu, Fan Liu +2
In this paper, we propose an efficient algorithm for the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a comm…
An efficient linear programming rounding-and-refinement algorithm for large-scale network slicing problem
Wei-Kun Chen, Ya-Feng Liu, Yu-Hong Dai +1
In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastr…
Efficient presolving methods for the influence maximization problem
Sheng-Jie Chen, Wei-Kun Chen, Yu-Hong Dai +2
We consider the influence maximization problem (IMP) which asks for identifying a limited number of key individuals to spread influence in a network such that the expected number o…
An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
Liang Chen, Wei-Kun Chen, Mu-Ming Yang +1
In this paper, we concentrate on generating cutting planes for the unsplittable capacitated network design problem. We use the unsplittable flow arc-set polyhedron of the considere…
Optimal Network Slicing for Service-Oriented Networks with Flexible Routing and Guaranteed E2E Latency
Wei-Kun Chen, Ya-Feng Liu, Antonio De Domenico +2
Network function virtualization is a promising technology to simultaneously support multiple services with diverse characteristics and requirements in the 5G and beyond networks. I…
Solving Heated Oil Pipeline Problems Via Mixed Integer Nonlinear Programming Approach
Muming Yang, Yakui Huang, Yu-Hong Dai +1
It is a crucial problem how to heat oil and save running cost for crude oil transport. This paper strictly formulates such a heated oil pipeline problem as a mixed integer nonlinea…
On the complexity of sequentially lifting cover inequalities for the knapsack polytope
Wei-Kun Chen, Yu-Hong Dai
The well-known sequentially lifted cover inequality is widely employed in solving mixed integer programs. However, it is still an open question whether a sequentially lifted cover…
Joint Power and Admission Control: Non-Convex Approximation and An Effective Polynomial Time Deflation Approach
Ya-Feng Liu, Yu-Hong Dai, Shiqian Ma
In an interference limited network, joint power and admission control (JPAC) aims at supporting a maximum number of links at their specified signal to interference plus noise ratio…