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...
Saved in:
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: | |
Online Access: | https://ieeexplore.ieee.org/document/10854442/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
by: Bryce Fuller, et al.
Published: (2024-01-01) -
Graph coarsening for fugitive interception
by: Irene S. van Droffelaar, et al.
Published: (2025-01-01) -
ROUTE FIRST-CLUSTER SECOND METHOD FOR PERSONAL SERVICE ROUTING PROBLEM
by: MELİKE KÜBRA EKİZ, et al.
Published: (2019-06-01) -
A Computer Vision-Based Framework for Snow Removal Operation Routing
by: Mohamed Karaa, et al.
Published: (2024-01-01) -
Cluster-based route convergence method based on network state graph model
by: PAN Chengsheng, et al.
Published: (2024-12-01)