Hybrid Quantum Benders' Decomposition For Mixed-integer Linear Programming

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' dec...

Full description

Bibliographic Details

Published in:	IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC pp. 2536 - 2540
Main Authors:	Zhao, Zhongqi, Fan, Lei, Han, Zhu
Format:	Conference Proceeding
Language:	English
Published:	IEEE 10.04.2022
Subjects:	Annealing Benders' Decomposition Communication Computational modeling Computers Conferences Hybrid Quantum-Classical Computing Machine learning Machine learning algorithms Mixed-integer Linear Programming Networking Quantum annealing Quantum Computing
ISSN:	1558-2612
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!