Wei-Kun Chen

Wei-Kun Chen

Auto-generated profile, based on publicly available information

Wei-Kun Chen

School of Mathematics and Statistics, Beijing Institute of Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 June 2023 in ACM Transactions on Mathematical Software
Verified
Journal Article
Open access
KBKsenia Bestuzheva
Ksenia Bestuzheva
MBMathieu Besançon
Mathieu Besançon
WCWei-Kun Chen
Wei-Kun Chen
ACAntonia Chmiela
Antonia Chmiela
TDTim Donkiewicz
Tim Donkiewicz
JWJakob Witzig
Jakob Witzig
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP . The focus of this article is on the role of the SCIP Optimization Suite in supporting research. SCIP ’s main design principles are discussed, followed by a presentation of the latest performance improvements and developments in version 8.0, which serve both as examples of SCIP ’s application as a research tool and as a platform for further developments. Furthermore, this article gives an overview of interfaces to other programming and modeling languages, new features that expand the possibilities for user interaction with the framework, and the latest developments in several extensions built upon SCIP .

21 March 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
ZGZehua Guo
Zehua Guo
WCWeikun Chen
Weikun Chen
YLYa-Feng Liu
Ya-Feng Liu
YXYang Xu
Yang Xu
ZZZhi-Li Zhang
Zhi-Li Zhang
To improve traffic management ability, Internet Service Providers (ISPs) are gradually upgrading legacy network devices to programmable devices that support Software-Defined Networking (SDN). The coexistence of legacy and SDN devices gives rise to a hybrid SDN. Existing hybrid SDNs do not consider the potential performance issues introduced by a centralized SDN controller: flow requests processed by a highly loaded controller may experience long tail processing delay; inappropriate multi-controller deployment could increase the propagation delay of flow requests. In this paper, we propose to jointly consider the deployment of SDN switches and their controllers for hybrid SDNs. We formulate the joint problem as an optimization problem that maximizes the number of flows that can be controlled and managed by the SDN and minimizes the propagation delay of flow requests between SDN controllers and switches under a given upgrade budget constraint. We show this problem is NP-hard. To efficiently solve the problem, we propose some techniques (e.g., strengthening the constraints and adding additional valid inequalities) to accelerate the global optimization solver for solving the problem for small networks and an efficient heuristic algorithm for solving it for large networks. The simulation results from real network topologies illustrate the effectiveness of the proposed techniques and show that our proposed heuristic algorithm uses a small number of controllers to manage a high amount of flows with good performance.

8 June 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
WCWei-Kun Chen
Wei-Kun Chen
YLYa-Feng Liu
Ya-Feng Liu
ADAntonio De Domenico
Antonio De Domenico
ZLZhi-Quan Luo
Zhi-Quan Luo
YDYu-Hong Dai
Yu-Hong Dai
Network function virtualization is a promising technology to simultaneously support multiple services with diverse characteristics and requirements in the 5G and beyond networks. In particular, each service consists of a predetermined sequence of functions, called service function chain (SFC), running on a cloud environment. To make different service slices work properly in harmony, it is crucial to appropriately select the cloud nodes to deploy the functions in the SFC and flexibly route the flow of the services such that these functions are processed in the order defined in the corresponding SFC, the end-to-end (E2E) latency constraints of all services are guaranteed, and all cloud and communication resource budget constraints are respected. In this paper, we first propose a new mixed binary linear program (MBLP) formulation of the above network slicing problem that optimizes the system energy efficiency while jointly considers the E2E latency requirement, resource budget, flow routing, and functional instantiation. Then, we develop another MBLP formulation and show that the two formulations are equivalent in the sense that they share the same optimal solution. However, since the numbers of variables and constraints in the second problem formulation are significantly smaller than those in the first one, solving the second problem formulation is more computationally efficient especially when the dimension of the corresponding network is large. Numerical results demonstrate the advantage of the proposed formulations compared with the existing ones.

20 January 2025 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
ZWZheyu Wu
Zheyu Wu
YLYa-Feng Liu
Ya-Feng Liu
WCWei-Kun Chen
Wei-Kun Chen
CMChristos Masouros
Christos Masouros
Both dual-functional radar-communication (DFRC) and massive multiple-input multiple-output (MIMO) have been recognized as enabling technologies for 6G wireless networks. This paper considers the advanced waveform design for hardware-efficient massive MIMO DFRC systems. Specifically, the transmit waveform is imposed with the quantized constant-envelope (QCE) constraint, which facilitates the employment of low-resolution digital-to-analog converters (DACs) and power-efficient amplifiers. The waveform design problem is formulated as the minimization of the mean square error (MSE) between the designed and desired beampatterns subject to the constructive interference (CI)-based communication quality of service (QoS) constraints and the QCE constraint. To solve the formulated problem, we first utilize the penalty technique to transform the discrete problem into an equivalent continuous penalty model. Then, we propose an inexact augmented Lagrangian method (ALM) algorithm for solving the penalty model. In particular, the ALM subproblem at each iteration is solved by a custom-built block successive upper-bound minimization (BSUM) algorithm, which admits closed-form updates, making the proposed inexact ALM algorithm computationally efficient. Simulation results demonstrate the superiority of the proposed approach over existing state-of-the-art ones. In addition, extensive simulations are conducted to examine the impact of various system parameters on the trade-off between communication and radar performances.

5 May 2023 in European Journal of Operational Research
Verified
Journal Article
Closed access
LCLiang Chen
Liang Chen
SCSheng-Jie Chen
Sheng-Jie Chen
WCWei-Kun Chen
Wei-Kun Chen
YDYu-Hong Dai
Yu-Hong Dai
TQTao Quan
Tao Quan
JCJuan Chen
Juan Chen

18 August 2020 in EURO Journal on Computational Optimization
Verified
Journal Article
Open access
PDF file
PGPatrick Gemander
Patrick Gemander
WCWei-Kun Chen
Wei-Kun Chen
DWDieter Weninger
Dieter Weninger
LGLeona Gottwald
Leona Gottwald
AGAmbros Gleixner
Ambros Gleixner
AMAlexander Martin
Alexander Martin
In state-of-the-art mixed-integer programming solvers, a large array of reduction techniques are applied to simplify the problem and strengthen the model formulation before starting the actual branch-and-cut phase. Despite their mathematical simplicity, these methods can have significant impact on the solvability of a given problem. However, a crucial property for employing presolve techniques successfully is their speed. Hence, most methods inspect constraints or variables individually in order to guarantee linear complexity. In this paper, we present new hashing-based pairing mechanisms that help to overcome known performance limitations of more powerful presolve techniques that consider pairs of rows or columns. Additionally, we develop an enhancement to one of these presolve techniques by exploiting the presence of set-packing structures on binary variables in order to strengthen the resulting reductions without increasing runtime. We analyze the impact of these methods on the MIPLIB 2017 benchmark set based on an implementation in the MIP solver SCIP.