Quantum Approximate Optimization Algorithm applied to multi-objective routing for large scale 6G networks

A multi-objective optimization problem involves optimizing two or more conflicting objectives simultaneously. This type of problem arises in many scientific and industrial areas and it is classified as NP-Hard. Network routing optimization with multiple objectives falls into this category. In the co...

Celý popis

Podrobná bibliografie

Vydáno v:	Computer networks (Amsterdam, Netherlands : 1999) Ročník 267; s. 111345
Hlavní autoři:	Bouchmal, Oumayma, Cimoli, Bruno, Stabile, Ripalta, Vegas Olmos, Juan Jose, Tafur Monroy, Idelfonso
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.07.2025
Témata:	Multi-objective routing Quadratic unconstrained binary optimization Quantum Approximate Optimization Algorithm Quantum computing Quantum optimization 6G Quantum computing Quantum Approximate Optimization Algorithm Quantum optimization Quadratic unconstrained binary optimization Multi-objective routing
ISSN:	1389-1286
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!