177 related articles for article (PubMed ID: 37628268)
1. Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem.
Qian W; Basili RAM; Eshaghian-Wilner MM; Khokhar A; Luecke G; Vary JP
Entropy (Basel); 2023 Aug; 25(8):. PubMed ID: 37628268
[TBL] [Abstract][Full Text] [Related]
2. Reinforcement learning assisted recursive QAOA.
Patel YJ; Jerbi S; Bäck T; Dunjko V
EPJ Quantum Technol; 2024; 11(1):6. PubMed ID: 38261853
[TBL] [Abstract][Full Text] [Related]
3. Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions.
Okada KN; Nishi H; Kosugi T; Matsushita YI
Sci Rep; 2024 Jan; 14(1):1167. PubMed ID: 38216611
[TBL] [Abstract][Full Text] [Related]
4. Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer.
Niroula P; Shaydulin R; Yalovetzky R; Minssen P; Herman D; Hu S; Pistoia M
Sci Rep; 2022 Oct; 12(1):17171. PubMed ID: 36229483
[TBL] [Abstract][Full Text] [Related]
5. Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator.
Pagano G; Bapat A; Becker P; Collins KS; De A; Hess PW; Kaplan HB; Kyprianidis A; Tan WL; Baldwin C; Brady LT; Deshpande A; Liu F; Jordan S; Gorshkov AV; Monroe C
Proc Natl Acad Sci U S A; 2020 Oct; 117(41):25396-25401. PubMed ID: 33024018
[TBL] [Abstract][Full Text] [Related]
6. A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model.
Wang Z; Wu X; Wu T
Comput Intell Neurosci; 2022; 2022():1450756. PubMed ID: 36093485
[TBL] [Abstract][Full Text] [Related]
7. Scaling quantum approximate optimization on near-term hardware.
Lotshaw PC; Nguyen T; Santana A; McCaskey A; Herrman R; Ostrowski J; Siopsis G; Humble TS
Sci Rep; 2022 Jul; 12(1):12388. PubMed ID: 35858955
[TBL] [Abstract][Full Text] [Related]
8. Multi-angle quantum approximate optimization algorithm.
Herrman R; Lotshaw PC; Ostrowski J; Humble TS; Siopsis G
Sci Rep; 2022 Apr; 12(1):6781. PubMed ID: 35474081
[TBL] [Abstract][Full Text] [Related]
9. Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem.
Shaydulin R; Li C; Chakrabarti S; DeCross M; Herman D; Kumar N; Larson J; Lykov D; Minssen P; Sun Y; Alexeev Y; Dreiling JM; Gaebler JP; Gatterman TM; Gerber JA; Gilmore K; Gresh D; Hewitt N; Horst CV; Hu S; Johansen J; Matheny M; Mengle T; Mills M; Moses SA; Neyenhuis B; Siegfried P; Yalovetzky R; Pistoia M
Sci Adv; 2024 May; 10(22):eadm6761. PubMed ID: 38809986
[TBL] [Abstract][Full Text] [Related]
10. Research on improved ant colony optimization for traveling salesman problem.
Fei T; Wu X; Zhang L; Zhang Y; Chen L
Math Biosci Eng; 2022 Jun; 19(8):8152-8186. PubMed ID: 35801461
[TBL] [Abstract][Full Text] [Related]
11. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem.
Wang ZC; Wu X; Liang K; Wu TH
IEEE Trans Nanobioscience; 2024 Jul; 23(3):391-402. PubMed ID: 38709614
[TBL] [Abstract][Full Text] [Related]
12. On approximating a new generalization of traveling salesman problem.
Huang Z; Liao X; Naik PA; Lu X
Heliyon; 2024 May; 10(10):e31297. PubMed ID: 38818174
[TBL] [Abstract][Full Text] [Related]
13. Circular Jaccard distance based multi-solution optimization for traveling salesman problems.
Li H; Zhang M; Zeng C
Math Biosci Eng; 2022 Mar; 19(5):4458-4480. PubMed ID: 35430823
[TBL] [Abstract][Full Text] [Related]
14. Load Balancing Based on Firefly and Ant Colony Optimization Algorithms for Parallel Computing.
Li Y; Li J; Sun Y; Li H
Biomimetics (Basel); 2022 Oct; 7(4):. PubMed ID: 36278725
[TBL] [Abstract][Full Text] [Related]
15. Solving the clustered traveling salesman problem
Lu Y; Hao JK; Wu Q
PeerJ Comput Sci; 2022; 8():e972. PubMed ID: 35721414
[TBL] [Abstract][Full Text] [Related]
16. Algorithm for DNA sequence assembly by quantum annealing.
Nałęcz-Charkiewicz K; Nowak RM
BMC Bioinformatics; 2022 Apr; 23(1):122. PubMed ID: 35392798
[TBL] [Abstract][Full Text] [Related]
17. Discrete Salp Swarm Algorithm for symmetric traveling salesman problem.
Chen P; Liu M; Zhou S
Math Biosci Eng; 2023 Mar; 20(5):8856-8874. PubMed ID: 37161225
[TBL] [Abstract][Full Text] [Related]
18. Efficient molecular conformation generation with quantum-inspired algorithm.
Li Y; Cui X; Xiong Z; Zou Z; Liu B; Wang BY; Shu R; Zhu H; Qiao N; Yung MH
J Mol Model; 2024 Jun; 30(7):228. PubMed ID: 38916778
[TBL] [Abstract][Full Text] [Related]
19. Hybrid pointer networks for traveling salesman problems optimization.
Stohy A; Abdelhakam HT; Ali S; Elhenawy M; Hassan AA; Masoud M; Glaser S; Rakotonirainy A
PLoS One; 2021; 16(12):e0260995. PubMed ID: 34905571
[TBL] [Abstract][Full Text] [Related]
20. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.
Hussain A; Muhammad YS; Nauman Sajid M; Hussain I; Mohamd Shoukry A; Gani S
Comput Intell Neurosci; 2017; 2017():7430125. PubMed ID: 29209364
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
