Novel approach to solving stochastic constrained shortest path problem with quantum computing
This thesis presents a new approach to tackling the stochastic constraint shortest path problem by using a quasi-optimal quantum algorithm. These problems are highly relevant in the real world, with broad applications in areas like transportation, logistics, and network optimization. We start the th...
Saved in:
Main Author: | Yang, Richard Chen Xiao |
---|---|
Other Authors: | Dusit Niyato |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/172135 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Shortest Dubins path for forward moving robots
by: Chan, Chor Cheng
Published: (2023) -
Constrained Shortest Path Computation
by: TERROVITIS, Manolis, et al.
Published: (2005) -
Shortest path amidst disc obstacles is computable
by: Chang, E.-C., et al.
Published: (2013) -
Hybrid evolutionary algorithm for multi-mode resource-constrained project scheduling problem
by: Marshal, Brian.
Published: (2011) -
Shortest path AMIDST disc obstacles is computable
by: Chang, E.-C., et al.
Published: (2013)