A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles.
S. Raja BalachandarK. KannanPublished in: Appl. Math. Comput. (2008)
Keyphrases
- knapsack problem
- dynamic programming
- learning algorithm
- optimal solution
- computational complexity
- cost function
- np hard
- np hard problems
- bicriteria
- worst case
- linear programming
- objective function
- particle swarm optimization
- optimization algorithm
- convex hull
- simulated annealing
- test problems
- combinatorial optimization problems
- exact solution
- quadratic programming
- search space
- lower bound
- multidimensional knapsack problem
- polynomial time complexity
- implicit enumeration