Accelerating Generalized Benders Decomposition for Wireless Resource Allocation

Abstract

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 deviceto-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.

A Fast Graph Neural Network-Based Method for Winner Determination in Multi-Unit Combinatorial Auctions

“…We are inspired by the success of ML in solving different NP-hard problems, e.g., [22], [23], [24], [25], [26], [27], [28], [29], [30]. In these works, ML is generally employed for two purposes.…”