Accelerating Generalized Benders Decomposition for Wireless Resource Allocation

by   Mengyuan Lee, et al.

Generalized Benders decomposition (GBD) is a globally optimal algorithm for mixed integer nonlinear programming (MINLP) problems, which are NP-hard and can be widely found in the area of wireless resource allocation. The main idea of GBD is decomposing an MINLP problem into a primal problem and a master problem, which are iteratively solved until their solutions converge. However, a direct implementation of GBD is time- and memory-consuming. The main bottleneck is the high complexity of the master problem, which increases over the iterations. Therefore, we propose to leverage machine learning (ML) techniques to accelerate GBD aiming at decreasing the complexity of the master problem. Specifically, we utilize two different ML techniques, classification and regression, to deal with this acceleration task. In this way, a cut classifier and a cut regressor are learned, respectively, to distinguish between useful and useless cuts. Only useful cuts are added to the master problem and thus the complexity of the master problem is reduced. By using a resource allocation problem in device-to-device communication networks as an example, we validate that the proposed method can reduce the computational complexity of GBD without loss of optimality and has strong generalization ability. The proposed method is applicable for solving various MINLP problems in wireless networks since the designs are invariant for different problems.


page 5

page 8

page 9

page 18

page 22

page 23

page 24

page 28


Learning to Branch: Accelerating Resource Allocation in Wireless Networks

Resource allocation in wireless networks, such as device-to-device (D2D)...

LORA: Learning to Optimize for Resource Allocation in Wireless Networks with Few Training Samples

Effective resource allocation plays a pivotal role for performance optim...

A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming

In this paper we deal with a network of agents seeking to solve in a dis...

Q-learning algorithm for resource allocation in WDMA-based optical wireless communication networks

Visible Light Communication (VLC) has been widely investigated during th...

Blue Data Computation Maximization in 6G Space-Air-Sea Non-Terrestrial Networks

Non-terrestrial networks (NTN), encompassing space and air platforms, ar...

Meta Partial Benders Decomposition for the Logistics Service Network Design Problem

Supply chain transportation operations often account for a large proport...

Constrained Resource Allocation Problems in Communications: An Information-assisted Approach

We consider a class of resource allocation problems given a set of uncon...

Please sign up or login with your details

Forgot password? Click here to reset