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...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
IEEE
2023-01-01
|
| シリーズ: | IEEE Access |
| 主題: | |
| オンライン･アクセス: | https://ieeexplore.ieee.org/document/10247510/ |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|