A rapid convergent genetic algorithm for NP-hard problems
暂无分享,去创建一个
[1] Gregory Gutin,et al. Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP , 2001, Discret. Appl. Math..
[2] Gregory Gutin,et al. Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments , 1997, Combinatorics, Probability and Computing.
[3] Nonel Thirer. A Pipelined based FPGA Implementation of a Genetic Algorithm , 2011, IJCCI.
[4] Nonel Thirer. A novel pipeline based FPGA implementation of a genetic algorithm , 2014, Sensing Technologies + Applications.
[5] Cheng-Kuan Lin,et al. Mutually orthogonal hamiltonian connected graphs , 2009, Appl. Math. Lett..
[6] Gaurang Panchal,et al. Solving NP hard Problems using Genetic Algorithm , 2015 .
[7] Patric R. J. Östergård,et al. Enumeration of Seidel matrices , 2017, Eur. J. Comb..
[8] Marcelo A. C. Fernandes,et al. High-Performance Parallel Implementation of Genetic Algorithm on FPGA , 2019, Circuits Syst. Signal Process..
[9] Dorothea Heiss-Czedik,et al. An Introduction to Genetic Algorithms. , 1997, Artificial Life.
[10] Steven Skiena,et al. The Algorithm Design Manual , 2020, Texts in Computer Science.
[11] Nonel Thirer. A pipelined FPGA implementation of an encryption algorithm based on genetic algorithm , 2013, Defense, Security, and Sensing.
[12] Carsten Thomassen,et al. Hamiltonian dicycles avoiding prescribed arcs in tournaments , 1987, Graphs Comb..
[13] David Coley,et al. Introduction to Genetic Algorithms for Scientists and Engineers , 1999 .