Wang An-bao

  • Citations Per Year
Learn More
The multiple knapsack problem(MKP) is a classified NP-hard optimization problem, which is a generalization of the simple knapsack problem (KP). Hence algorithms for finding the exact solution of MKP are not suitable for application in real-time decision-making applications. This paper presents a competitive decision algorithm (CDA) for MKP. CDA is newly(More)
  • 1