E Korutcheva et al 1994 J. Phys. A: Math. Gen. 27 L645 doi:10.1088/0305-4470/27/18/001
E Korutcheva, M Opper and B Lopez
Show affiliationsThe knapsack problem is an NP-complete combinatorial optimization problem with inequality constraints. Using the replica method of statistical physics, we study the space of its solutions for a large problem size. It turns out that this problem is closely related to the theory of the binary perceptron.
05.20.-y Classical statistical mechanics
Issue 18 (21 September 1994)
E Korutcheva et al 1994 J. Phys. A: Math. Gen. 27 L645
R Z Zhdanov 1994 J. Phys. A: Math. Gen. 27 L291
A Dimakis and F Muller-Hoissen 1994 J. Phys. A: Math. Gen. 27 3159
P B Thomas and D Dhar 1994 J. Phys. A: Math. Gen. 27 2257
R W Penney et al 1993 J. Phys. A: Math. Gen. 26 3681
A Dimakis et al 1993 J. Phys. A: Math. Gen. 26 1927
B Derrida et al 1993 J. Phys. A: Math. Gen. 26 1493
N Brunel et al 1992 J. Phys. A: Math. Gen. 25 5017
A W Sandvik 1992 J. Phys. A: Math. Gen. 25 3667
Y S Yang and C J Thompson 1991 J. Phys. A: Math. Gen. 24 L279