185 related articles for article (PubMed ID: 37628268)
21. 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]
22. mRNA codon optimization with quantum computers.
Fox DM; Branson KM; Walker RC
PLoS One; 2021; 16(10):e0259101. PubMed ID: 34714834
[TBL] [Abstract][Full Text] [Related]
23. A Novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem Based on DNA Computing.
Wang ZC; Liang K; Bao XG; Wu TH
IEEE Trans Nanobioscience; 2024 Apr; 23(2):220-232. PubMed ID: 37607150
[TBL] [Abstract][Full Text] [Related]
24. Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm.
Liu G; Xu X; Wang F; Tang Y
Comput Intell Neurosci; 2022; 2022():1008617. PubMed ID: 35463281
[TBL] [Abstract][Full Text] [Related]
25. Memory-efficient Transformer-based network model for Traveling Salesman Problem.
Yang H; Zhao M; Yuan L; Yu Y; Li Z; Gu M
Neural Netw; 2023 Apr; 161():589-597. PubMed ID: 36822144
[TBL] [Abstract][Full Text] [Related]
26. Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles.
Dalyac C; Henriet L; Jeandel E; Lechner W; Perdrix S; Porcheron M; Veshchezerova M
EPJ Quantum Technol; 2021; 8(1):12. PubMed ID: 34723197
[TBL] [Abstract][Full Text] [Related]
27. Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.
Mulder SA; Wunsch DC
Neural Netw; 2003; 16(5-6):827-32. PubMed ID: 12850040
[TBL] [Abstract][Full Text] [Related]
28. Colored Traveling Salesman Problem.
Li J; Zhou M; Sun Q; Dai X; Yu X
IEEE Trans Cybern; 2015 Nov; 45(11):2390-401. PubMed ID: 25494521
[TBL] [Abstract][Full Text] [Related]
29. Solving NP-Hard Problems with Physarum-Based Ant Colony System.
Liu Y; Gao C; Zhang Z; Lu Y; Chen S; Liang M; Tao L
IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(1):108-120. PubMed ID: 28182547
[TBL] [Abstract][Full Text] [Related]
30. Benchmarking treewidth as a practical component of tensor network simulations.
Dumitrescu EF; Fisher AL; Goodrich TD; Humble TS; Sullivan BD; Wright AL
PLoS One; 2018; 13(12):e0207827. PubMed ID: 30562341
[TBL] [Abstract][Full Text] [Related]
31. Dynamic graph Conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem.
Wang Y; Chen Z
Math Biosci Eng; 2022 Jul; 19(10):9730-9748. PubMed ID: 36031965
[TBL] [Abstract][Full Text] [Related]
32. Graph coloring using the reduced quantum genetic algorithm.
Ardelean SM; Udrescu M
PeerJ Comput Sci; 2022; 8():e836. PubMed ID: 35111921
[TBL] [Abstract][Full Text] [Related]
33. QAOA for Max-Cut requires hundreds of qubits for quantum speed-up.
Guerreschi GG; Matsuura AY
Sci Rep; 2019 May; 9(1):6903. PubMed ID: 31061384
[TBL] [Abstract][Full Text] [Related]
34. Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem.
Stodola P; Michenka K; Nohel J; Rybanský M
Entropy (Basel); 2020 Aug; 22(8):. PubMed ID: 33286654
[TBL] [Abstract][Full Text] [Related]
35. Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem.
Al-Mulhem M; Al-Maghrabi T
IEEE Trans Syst Man Cybern B Cybern; 1998; 28(4):618-20. PubMed ID: 18255981
[TBL] [Abstract][Full Text] [Related]
36. A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application.
Miao K; Duan H; Qian F; Dong Y
PLoS One; 2019; 14(4):e0215107. PubMed ID: 30995233
[TBL] [Abstract][Full Text] [Related]
37. Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem.
Dahan F; El Hindi K; Mathkour H; AlSalman H
Sensors (Basel); 2019 Apr; 19(8):. PubMed ID: 30999688
[TBL] [Abstract][Full Text] [Related]
38. The traveling salesman problem: a hierarchical model.
Graham SM; Joshi A; Pizlo Z
Mem Cognit; 2000 Oct; 28(7):1191-204. PubMed ID: 11126941
[TBL] [Abstract][Full Text] [Related]
39. Implementing Graph-Theoretic Feature Selection by Quantum Approximate Optimization Algorithm.
Li Y; Zhou RG; Xu R; Luo J; Hu W; Fan P
IEEE Trans Neural Netw Learn Syst; 2024 Feb; 35(2):2364-2377. PubMed ID: 35862330
[TBL] [Abstract][Full Text] [Related]
40. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.
Contreras-Bolton C; Parada V
PLoS One; 2015; 10(9):e0137724. PubMed ID: 26367182
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
