论文信息 - Metaheuristics for bioinformatics - 字舞流文

Metaheuristics for bioinformatics

Clarisse Dhaenens | C. Dhaenens

[1] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.

[2] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] Fred W. Glover,et al. A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[5] D. Wolpert,et al. No Free Lunch Theorems for Search , 1995 .

[6] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .

[7] H. Robbins. A Stochastic Approximation Method , 1951 .

[8] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[9] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[10] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[11] A. Mucherino,et al. Monkey search: a novel metaheuristic search for global optimization , 2007 .

[12] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .