A feasibility-preserved quantum approximate solver for the Capacitated Vehicle Routing Problem

The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most efficient plan for a fleet of vehicles to deliver goods to a...

Celý popis

Podrobná bibliografia

Vydané v:	Quantum information processing Ročník 23; číslo 8
Hlavní autori:	Xie, Ningyi, Lee, Xinwei, Cai, Dongsheng, Saito, Yoshiyuki, Asai, Nobuyoshi, Lau, Hoong Chuin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 29.07.2024
Predmet:	Data Structures and Information Theory Mathematical Physics Physics Physics and Astronomy Quantum Computing Quantum Information Technology Quantum Physics Spintronics Problem encoding Feasibility AOA CVRP QAOA
ISSN:	1573-1332, 1573-1332
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!