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

Celý popis

Podrobná bibliografia

Vydané v:	IEEE Wireless Communications and Networking Conference : [proceedings] : WCNC s. 2536 - 2540
Hlavní autori:	Zhao, Zhongqi, Fan, Lei, Han, Zhu
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 10.04.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!