These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
4. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem. Sutton AM; Neumann F; Nallaperuma S Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542 [TBL] [Abstract][Full Text] [Related]
5. 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]
6. Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem. Nallaperuma S; Neumann F; Sudholt D Evol Comput; 2017; 25(4):673-705. PubMed ID: 27893278 [TBL] [Abstract][Full Text] [Related]
7. A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem. Jiang ZB; Yang Q PLoS One; 2016; 11(11):e0165804. PubMed ID: 27812175 [TBL] [Abstract][Full Text] [Related]
8. Fast algorithms for transforming back and forth between a signed permutation and its equivalent simple permutation. Gog S; Bader M J Comput Biol; 2008 Oct; 15(8):1029-41. PubMed ID: 18781831 [TBL] [Abstract][Full Text] [Related]
9. The Collaborative Local Search Based on Dynamic-Constrained Decomposition With Grids for Combinatorial Multiobjective Optimization. Cai X; Xia C; Zhang Q; Mei Z; Hu H; Wang L; Hu J IEEE Trans Cybern; 2021 May; 51(5):2639-2650. PubMed ID: 31425134 [TBL] [Abstract][Full Text] [Related]
10. Solving the Traveling Salesman's Problem Using the African Buffalo Optimization. Odili JB; Mohmad Kahar MN Comput Intell Neurosci; 2016; 2016():1510256. PubMed ID: 26880872 [TBL] [Abstract][Full Text] [Related]
11. Approaching the Traveling Tournament Problem with Randomized Beam Search. Frohner N; Neumann B; Pace G; Raidl GR Evol Comput; 2023 Sep; 31(3):233-257. PubMed ID: 37310276 [TBL] [Abstract][Full Text] [Related]
13. A methodology to find the elementary landscape decomposition of combinatorial optimization problems. Chicano F; Whitley LD; Alba E Evol Comput; 2011; 19(4):597-637. PubMed ID: 21469972 [TBL] [Abstract][Full Text] [Related]
14. Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem. Pourhassan M; Neumann F Evol Comput; 2019; 27(3):525-558. PubMed ID: 29932364 [TBL] [Abstract][Full Text] [Related]
15. An evaluation of methods for estimating the number of local optima in combinatorial optimization problems. Hernando L; Mendiburu A; Lozano JA Evol Comput; 2013; 21(4):625-58. PubMed ID: 23270389 [TBL] [Abstract][Full Text] [Related]
16. On the suitability of different representations of solid catalysts for combinatorial library design by genetic algorithms. Gobin OC; Schüth F J Comb Chem; 2008; 10(6):835-46. PubMed ID: 18693763 [TBL] [Abstract][Full Text] [Related]
17. Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes. Daolio F; Liefooghe A; Verel S; Aguirre H; Tanaka K Evol Comput; 2017; 25(4):555-585. PubMed ID: 27689467 [TBL] [Abstract][Full Text] [Related]
18. Anatomy of the Attraction Basins: Breaking with the Intuition. Hernando L; Mendiburu A; Lozano JA Evol Comput; 2019; 27(3):435-466. PubMed ID: 29786459 [TBL] [Abstract][Full Text] [Related]