Graph Coarsening Approach to the Vehicle Routing Problem: An Approximation Strategy

Graph Coarsening Approach to the Vehicle Routing Problem: An Approximation Strategy

In the Noisy Intermediate-Scale Quantum (NISQ) era of quantum computing, solving complex optimization problems such as the Vehicle Routing Problem (VRP) remains a formidable challenge. To overcome this obstacle, we introduce a novel method in this paper that focuses on reducing the number of edges i...

Full description

Saved in:
Bibliographic Details
Main Authors: Katarzyna Nalecz-Charkiewicz, Arnav Das, Turbasu Chatterjee, Joshua Keene, Pawel Gora, Carlos C. N. Kuhn
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Access
Subjects:
Combinatorial optimization
graph reduction
vehicle routing
quantum computing
Online Access:https://ieeexplore.ieee.org/document/10854442/
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://ieeexplore.ieee.org/document/10854442/

Similar Items