A statistical analysis of the knapsack problem
暂无分享,去创建一个
[1] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[2] K. Binder,et al. Spin glasses: Experimental facts, theoretical concepts, and open questions , 1986 .
[3] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[4] P. Anderson,et al. Application of statistical mechanics to NP-complete problems in combinatorial optimisation , 1986 .
[5] M. Mézard,et al. Replicas and optimization , 1985 .
[6] M. Opper,et al. Statistical mechanics of the knapsack problem , 1994 .
[7] M. Mézard,et al. On the statistical mechanics of optimization problems of the travelling salesman type , 1984 .
[8] S. Kirkpatrick,et al. Solvable Model of a Spin-Glass , 1975 .
[9] C. Peterson,et al. Solving optimization problems with mean field methods , 1993 .
[10] Harvey M. Salkin,et al. Integer Programming , 2019, Engineering Optimization Theory and Practice.
[11] Prügel-Bennett,et al. Analysis of genetic algorithms using statistical mechanics. , 1994, Physical review letters.
[12] S Kirkpatrick,et al. Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] Carsten Peterson,et al. Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem , 1993, Neural Computation.
[15] M. Mézard,et al. A replica analysis of the travelling salesman problem , 1986 .
[16] José F. Fontanari,et al. The statistical mechanics of the Ising perceptron , 1993 .