67 citations · 74 across the 30 of their papers we have counts for
8 papers · 1 filter
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,…
One-Bit MIMO Detection: From Global Maximum-Likelihood Detector to Amplitude Retrieval Approach
Mingjie Shao, Wei-Kun Chen, Cheng-Yang Yu +2
As communication systems advance towards the future 6G era, the incorporation of large-scale antenna arrays in base stations (BSs) presents challenges such as increased hardware co…
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…