Skip to main content

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

  • Conference paper
  • First Online:
Recent Advances in Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2018)

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Siu, K.-Y., Roychowdhury, V., Kailath, T.: Discrete Neural Computation: A Theoretical Foundation, pp. 345–385 (1995)

    Google Scholar 

  2. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems, pp. 235–271. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Gens, G.Y., Levner, E.V.: Computational complexity of approximation algorithms for combinatorial problems. Math. Found. Comput. Sci. 1979, 292–300 (1979)

    MATH  Google Scholar 

  4. Hopofield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. 79, 2554–2558 (1982)

    Article  MathSciNet  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hsin-Lung Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, HL., Chang, JS., Chang, JC. (2019). A New Approximation Algorithm for the d-dimensional Knapsack Problem Based on Hopfield Networks. In: Pan, JS., Ito, A., Tsai, PW., Jain, L. (eds) Recent Advances in Intelligent Information Hiding and Multimedia Signal Processing. IIH-MSP 2018. Smart Innovation, Systems and Technologies, vol 109. Springer, Cham. https://doi.org/10.1007/978-3-030-03745-1_5

Download citation

Publish with us

Policies and ethics