Reactive Search: Machine Learning for

[1]  Philip N. Strenski,et al.  Analysis of finite length annealing schedules , 2005, Algorithmica.

[2]  Pierre Hansen,et al.  Algorithms for the maximum satisfiability problem , 1987, Computing.

[3]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[4]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[5]  Rudolf Bayer,et al.  Symmetric binary B-Trees: Data structure and maintenance algorithms , 1972, Acta Informatica.

[6]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[7]  Holger H. Hoos,et al.  Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.

[8]  Niaz A. Wassan,et al.  A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls , 2002 .

[9]  T. Genji,et al.  Comparative Study of Modern Heuristic Algorithms to Service Restoration in Distribution Systems , 2001, IEEE Power Engineering Review.

[10]  Mauro Brunato,et al.  Reactive Search for Traffic Grooming in WDM Networks , 2001, IWDC.

[11]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

[12]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[13]  Uwe T. Zimmermann,et al.  Real-time dispatch of trams in storage yards , 2000, Ann. Oper. Res..

[14]  Patrick Siarry,et al.  Tabu Search applied to global optimization , 2000, Eur. J. Oper. Res..

[15]  Fernando G. Lobo,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[16]  Roberto Battiti,et al.  Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP) , 1999, Discret. Appl. Math..

[17]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[18]  Roberto Battiti,et al.  Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning , 1999, IEEE Trans. Computers.

[19]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[20]  Edward P. K. Tsang,et al.  Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..

[21]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[22]  Roberto Battiti.  Partially persistent dynamic sets for history-sensitive heuristics , 1999, Data Structures, Near Neighbor Searches, and Methodology.

[23]  Rex K. Kincaid,et al.  Reactive Tabu Search and Sensor Selection in Active Structural Acoustic Control Problems , 1998, J. Heuristics.

[24]  Andrew W. Moore,et al.  Learning Evaluation Functions for Global Optimization and Boolean Satisfiability , 1998, AAAI/IAAI.

[25]  Toshihide Ibaraki,et al.  A tabu search approach to the constraint satisfaction problem as a general problem solver , 1998, Eur. J. Oper. Res..

[26]  Wen-Chyuan Chiang,et al.  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows , 1997, INFORMS J. Comput..

[27]  Johan Håstad,et al.  Clique is hard to approximate within n1-epsilon , 1996, Electron. Colloquium Comput. Complex..

[28]  Roberto Battiti,et al.  Reactive search, a history-sensitive heuristic for MAX-SAT , 1997, JEAL.

[29]  S. Baluja,et al.  Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .

[30]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

[31]  Roberto Battiti,et al.  The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization , 1996, Ann. Oper. Res..

[32]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[33]  Andrew W. Moore,et al.  Memory-based Stochastic Optimization , 1995, NIPS.

[34]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[35]  Giorgio Ausiello,et al.  Theoretical Computer Science Approximate Solution of Np Optimization Problems * , 2022 .

[36]  John N. Hooker,et al.  Testing heuristics: We have it all wrong , 1995, J. Heuristics.

[37]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

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

[39]  Roberto Battiti,et al.  TOTEM: A HIGHLY PARALLEL CHIP FOR TRIGGERING APPLICATIONS WITH INDUCTIVE LEARNING BASED ON THE REACTIVE TABU SEARCH , 1995 .

[40]  R. Battiti,et al.  Local search with memory: benchmarking RTS , 1995 .

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

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

[43]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[44]  Umesh V. Vazirani,et al.  An Introduction to Computational Learning Theory , 1994 .

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

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

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

[48]  Jan Korst,et al.  Deterministic and randomized local search , 1993 .

[49]  Gilbert Syswerda,et al.  Simulated Crossover in Genetic Algorithms , 1992, FOGA.

[50]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

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

[52]  Chiang Tzuu-Shuh,et al.  On the convergence rate of annealing processes , 1988 .

[53]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[54]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[55]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[56]  Robert E. Tarjan,et al.  Updating a Balanced Search Tree in O(1) Rotations , 1983, Inf. Process. Lett..

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

[58]  David Maier,et al.  Hysterical B-trees , 1981, Inf. Process. Lett..

[59]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[60]  Leonidas J. Guibas,et al.  A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[61]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .