Local search with memory: benchmarking RTS

[1]  Roberto Battiti,et al.  Training neural nets with the reactive tabu search , 1995, IEEE Trans. Neural Networks.

[2]  R. Battiti,et al.  Simulated annealing and Tabu search in the long run: A comparison on QAP tasks☆ , 1994 .

[3]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[4]  A. Fréville,et al.  An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem , 1993 .

[5]  David L. Woodruff,et al.  Hashing vectors for tabu search , 1993, Ann. Oper. Res..

[6]  Afonso Ferreira,et al.  BOUNDING THE PROBABILITY OF SUCCESS OF STOCHASTIC METHODS FOR GLOBAL OPTIMIZATION , 1993 .

[7]  Stefan Voß,et al.  Dynamic tabu list management using the reverse elimination method , 1993, Ann. Oper. Res..

[8]  C. Peterson,et al.  Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem , 1993, Neural Computation.

[9]  Roberto Battiti,et al.  Parallel biased search for combinatorial optimization: genetic algorithms and TABU , 1992, Microprocess. Microsystems.

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

[11]  Laveen N. Kanal,et al.  Knapsack packing networks , 1992, IEEE Trans. Neural Networks.

[12]  Heinz Mühlenbein,et al.  The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..

[13]  S. Martello,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[14]  Alain Hertz,et al.  Tabu search techniques , 1989 .

[15]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[16]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.

[17]  Rainer E. Burkard,et al.  Probabilistic asymptotic properties of some combinatorial optimization problems , 1985, Discret. Appl. Math..

[18]  Charles M. Rader,et al.  Fast transforms: Algorithms, analyses, applications , 1984 .

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

[20]  N. Ahmed,et al.  FAST TRANSFORMS, algorithms, analysis, applications , 1983, Proceedings of the IEEE.

[21]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[22]  D. Knuth.  The art of computer programming: V.2.: Seminumerica algorithms , 1997 .

[23]  Kenneth A. De Jong,et al.  An Analysis of Multi-Point Crossover , 1990, FOGA.

[24]  Larry J. Eshelman,et al.  Spurious Correlations and Premature Convergence in Genetic Algorithms , 1990, FOGA.

[25]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[26]  Carsten Peterson,et al.  A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..

[27]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[28]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[29]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[30]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[31]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 2 , 1981 .

[32]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[33]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[34]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .