A new adaptive multi-start technique for combinatorial global optimizations

[1]  A. Kahng,et al.  Best-so-far vs. where-you-are: implications for optimal finite-time annealing , 1994 .

[2]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[3]  Christos H. Papadimitriou,et al.  The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..

[4]  Chung-Kuan Cheng,et al.  A two-level two-way partitioning algorithm , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[5]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[6]  David S. Johnson,et al.  Local Optimization and the Traveling Salesman Problem , 1990, ICALP.

[7]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[8]  N. Parga,et al.  Ultrametricity, frustration and the graph colouring problem , 1989 .

[9]  T. C. Hu,et al.  Optimization of globally convex functions , 1989 .

[10]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[11]  Heinz Mühlenbein,et al.  Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

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

[13]  D. Ackley.  A connectionist machine for genetic hillclimbing , 1987 .

[14]  E. Baum.  Towards practical `neural' computation for combinatorial optimization problems , 1987 .

[15]  N. Sourlas.  Statistical mechanics and the travelling Salesman problem , 1986 .

[16]  M. Mézard,et al.  A replica analysis of the travelling salesman problem , 1986 .

[17]  Steve R. White,et al.  Configuration Space Analysis for Optimization Problems , 1986 .

[18]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[19]  S. Kirkpatrick,et al.  Configuration space analysis of travelling salesman problems , 1985 .

[20]  Frank Thomson Leighton,et al.  Graph bisection algorithms with good average case behavior , 1984, Comb..

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