Skip to main content

and
  1. No Access

    Chapter and Conference Paper

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

    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...

    Hsin-Lung Wu, Jui-Sheng Chang in Recent Advances in Intelligent Information… (2019)