Trip Planning Based on subQUBO Annealing
The trip planning problem (TPP) can be formulated as a combinatorial optimization problem that searches for the best route to visit a series of landmarks and hotels. Meanwhile, Ising machines have attracted attention due to their efficiency in solving combinatorial optimization problems. The Ising m...
Tallennettuna:
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
IEEE
2023-01-01
|
| Sarja: | IEEE Access |
| Aiheet: | |
| Linkit: | https://ieeexplore.ieee.org/document/10247510/ |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|