Nature's way of optimizing

Alpert, 1995, Recent directions in netlist partitioning: A survey, Integration: The VLSI Journal, Vol. 19, 1, 10.1016/0167-9260(95)00008-4 Bak, 1996 Bak, 1993, Punctuated equilibrium and criticality in a simple model of evolution, Phys. Rev. Lett., Vol. 71, 4083, 10.1103/PhysRevLett.71.4083 Bak, 1987, Self-organized criticality: An explanation of 1/f -noise, Phys. Rev. Lett., Vol. 59, 381, 10.1103/PhysRevLett.59.381 Boettcher, 1999, Extremal optimization of graph partitioning at the percolation threshold, J. Phys. A: Math. Gen., Vol. 32, 5201, 10.1088/0305-4470/32/28/302 Boettcher, 1996, Ultrametricity and memory in a solvable model of self-organized criticality, Phys. Rev. E, Vol. 54, 1082, 10.1103/PhysRevE.54.1082 Boettcher, 1997, Aging in a model of self-organized criticality, Phys. Rev. Lett., Vol. 79, 889, 10.1103/PhysRevLett.79.889 Boettcher, 1999, Extremal optimization: Methods derived from Co-Evolution, 825 Bounds, 1987, New optimization methods from physics and biology, Nature, Vol. 329, 215, 10.1038/329215a0 Bui, 1996, Genetic algorithm and graph partitioning, IEEE Trans. Comput., Vol. 45, 841, 10.1109/12.508322 Chialvo, 1990, Learning from mistakes, Neuroscience, Vol. 90, 1137, 10.1016/S0306-4522(98)00472-2 Černy, 1985, A thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, J. Optimization Theory Appl., Vol. 45, 41, 10.1007/BF00940812 Darwin, 1859 Dunlop, 1985, A procedure for placement of standard-cell VLSI circuits, IEEE Trans. Computer-Aided Design, Vol. CAD-4, 92, 10.1109/TCAD.1985.1270101 Garey, 1979 Glover, 1986, Future paths for integer programming and links to artificial intelligence, Computers and Oper. Res., Vol. 13, 533, 10.1016/0305-0548(86)90048-1 Greene, 1986, Simulated annealing without rejected moves, IEEE Trans. Computer-Aided Design, Vol. CAD-5, 221, 10.1109/TCAD.1986.1270190 Hendrickson, 1995, A multilevel algorithm for partitioning graphs Holland, 1975 C. Hurwitz, GNU tsp_solve, available at: http://www.cs.sunysb.edu/~algorith/implement/tsp/implement.shtml Johnson, 1990, Local optimization and the traveling salesman problem, Vol. 443, 446 Johnson, 1997, The traveling salesman problem: A case study, 215 Johnson, 1989, Optimization by simulated annealing: An experimental evaluation, Part I (graph partitioning), Oper. Res., Vol. 37, 865, 10.1287/opre.37.6.865 Kirkpatrick, 1983, Optimization by simulated annealing, Science, Vol. 220, 671, 10.1126/science.220.4598.671 Martin, 1996, Combining simulated annealing with local search heuristics, Ann. Oper. Res., Vol. 63, 57, 10.1007/BF02601639 Mezard, 1987 Merz, 1998, Memetic algorithms and the fitness landscape of the graph bi-partitioning problem, Vol. 1498, 765 Merz, 1998 Metropolis, 1953, Equation of state calculations by fast computing machines, J. Chem. Phys., Vol. 21, 1087, 10.1063/1.1699114 Paczuski, 1996, Avalanche dynamics in evolution, growth, and depinning models, Phys. Rev. E, Vol. 53, 414, 10.1103/PhysRevE.53.414 1993 Selman, 1995, A new method for solving hard satisfiability problems, 440 Sneppen, 1995, Evolution as a self-organized critical phenomenon, Proc. Natl. Acad. Sci., Vol. 92, 5209, 10.1073/pnas.92.11.5209 1996