Paper Info
Title
Hybrid Quantum Benders' Decomposition For Mixed-integer Linear Programming
Abstract
The Benders' decomposition algorithm is a technique in mathematical programming for complex mixed-integer linear programming (MILP) problems with a particular block structure. The strategy of Benders' decomposition can be described as a strategy of divide and conquer. The Benders' decomposition algorithm has been employed in a variety of applications such as communication, networking, and machine learning. However, the master problem in Benders' decomposition is still NP-hard, which motivates us to employ quantum computing. In the paper, we propose a hybrid quantum-classical Benders' decomposition algorithm. We transfer the Benders' decomposition's master problem into the quadratic unconstrained binary optimization (QUBO) model and solve it by the state-of-the-art quantum annealer. Then, we analyze the computational results and discuss the feasibility of the proposed algorithm. Due to our reformulation in the master problem in Benders' decomposition, our hybrid algorithm, which takes advantage of both classical and quantum computers, can guarantee the solution quality for solving MILP problems.
Year
DOI
Venue
2022
10.1109/WCNC51071.2022.9771632
2022 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)
Keywords
DocType
ISSN
Benders' Decomposition, Mixed-integer Linear Programming, Hybrid Quantum-Classical Computing, Quantum Computing, Communication, Networking
Conference
1525-3511
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Zhongqi Zhao100.34
Lei Fan200.68
Zhu Han311215760.71