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
Yukito Iba 1999 J. Phys. A: Math. Gen. 32 3875
J L van Hemmen and R G Palmer 1979 J. Phys. A: Math. Gen. 12 563
Kazuyuki Tanaka 2002 J. Phys. A: Math. Gen. 35 R81
Yoshiyuki Kabashima and David Saad 2004 J. Phys. A: Math. Gen. 37 R1
Peter Yoachim and Julianne J. Dalcanton 2006 The Astronomical Journal 131 226
Anand R Gopal and Daniel M Kammen 2009 Environ. Res. Lett. 4 044005
M. Andersen et al 2008 ApJ 683 L183
M Desoil et al 2005 J. Phys.: Conf. Ser. 17 45
Rong Yu et al 2008 New J. Phys. 10 013034