Statistical mechanics and combinatorial optimization

1

P. Cheeseman, B. Kanefsky, and W.M. Taylor.
Computational complexity and phase transitions.
In Workshop on Physics and Computation. IEEE Computer Society, 1992.

2

T. Hogg.
Statistical mechanics of combinatorial search.
In Workshop on Physics and Computation, Dallas, Texas, 1994.

3

T. Hogg, B.A. Huberman, and C.P. Williams.
Phase transitions and the search problem.
Artificial Intelligence, 81:1-15, 1996.

4

B.A. Huberman and T. Hogg.
Phase transitions in artificial intelligence systems.
Artificial Intelligence, 33:155-170, 1987.

5

W.G. Macready, A.G. Siapas, and S.A. Kauffman.
Criticality and parallelism in combinatorial optimization.
Science, 271:56-59, 1996.

6

W.G. Macready and D.H. Wolpert.
On 2-armed gaussian bandits and optimization.
Technical report, Santa Fe Institute, 1996.

7

W.G. MacReady and D.H. Wolpert.
What makes an optimization problem hard?
Complexity, 1(5):40-46, 1996.

8

R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky.
Phase transition and search cost in the (2 + p)-sat problem.
In T. Toffoli, M. Biafore, and J. Le ao, editors, 4th Workshop on Physics and Computation, pages 229-232, 1996.

9

R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky.
Determining computational complexity from characteristics "phase transitions".
Nature, 400:133-137, 1999.

10

A. Schoneveld, J.F. de Ronde, and P.M.A. Sloot.
On the complexity of task allocation.
Complexity, 3(2):52-60, 1997.

11

P.F. Stadler.
Correlation in landscapes of combinatorial optimization problems.
Europhysics Let., 20(6):479-482, 1992.

12

P.F. Stadler.
Towards a theory of landscapes.
Technical report, 1995.

13

P.F. Stadler and R. Happel.
Correlation structure of the landscape of the graph-bipartitioning problem.
Journal of Physics A, 25:3103-3110, 1992.

14

P.F. Stadler and B. Krakhofer.
Local minima of p-spin models.
Technical report, Santa Fe Institute, 1996.

15

P.F. Stadler and W. Schnabl.
The landscape of the traveling salesman problem.
Physics Lettters A, 161:337-344, 1992.

16

H.E. Stanley, L.A.N. Amaral, S.V.Buldyrev, A.L. Goldberger, S. Havlin, B.T. Hyman, H. Leschorn, P. Maass, H.A. Makse, C.-K. Peng, M.A. Salinger, M.H.R. Stanley, and G.M. Viswanathan.
Scaling and universality in living systems.
Fractals, 4(3):427-451, 1996.

17

M.H.R. Stanley, L.A.N. Amaral, S.V. Buldyrev, S. Havlin, H. Leschorn, P. Maass, M.A. Salinger, and H.E. Stanley.
Can statistical physics contribute to the science of economics?
Fractals, 4(3):415-425, 1996.

18

E.D. Weinberger.
Correlated and uncorrelated fitness landscapes and how to tell the difference.
Biological Cybernetics, 63:325, 1990.

19

E.D. Weinberger.
Np completeness of kauffman's n-k model, a tuneably rugged fitness landscape.
Technical report, Santa Fe Institute, 1996.

20

C.P. Williams and T. Hogg.
Using deep structure to locate hard problems.
In Proceedings of the 10th National Conference on Artificial Intelligence, pages 472-477, San Jose, California, 1992.

21

C.P. Williams and T. Hogg.
Phase transitions and coarse-grained search.
In Workshop on Physics and Computation, Dallas, Texas, 1994.

22

U. Yoshiyuki, K. Yoshiki, and K. Masatoshi.
Solving the traveling salesman problem by a statistical physics method.
Computers in physics, 10(6):525-530, 1996.