A New Approximation Algorithm for the d-dimensional Knapsack Problem Based on Hopfield Networks

  • Hsin-Lung WuEmail author
  • Jui-Sheng Chang
  • Jen-Chun Chang
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 109)


In this paper, we study the d-dimensional knapsack problem (d-KP). The problem d-KP is a generalized version of the well-known knapsack problem (1-KP) which is known to be an NP-complete problem. It is also known that there is no fully polynomial-time approximation scheme for d-KP for \(d >1\) unless \(P=NP\). In this work, we design an approximation algorithm for d-KP based on the Hopfield networks. Experimental results show that our proposed algorithm outperforms a well-known greedy algorithm in many cases.


d-dimensional knapsack problem Hopfield network Approximation algorithm NP-complete 


  1. 1.
    Siu, K.-Y., Roychowdhury, V., Kailath, T.: Discrete Neural Computation: A Theoretical Foundation, pp. 345–385 (1995)Google Scholar
  2. 2.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems, pp. 235–271. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Gens, G.Y., Levner, E.V.: Computational complexity of approximation algorithms for combinatorial problems. Math. Found. Comput. Sci. 1979, 292–300 (1979)zbMATHGoogle Scholar
  4. 4.
    Hopofield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. 79, 2554–2558 (1982)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Korte, B., Schrader, R.: On the existence of fast approximation schemes. In: Nonlinear Programming, vol. 4, pp. 415–437. Academic Press, New York (1981)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Taipei UniversityNew Taipei CityTaiwan

Personalised recommendations