A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space.
Noriyuki FujimotoPublished in: COCOA (2016)
Keyphrases
- knapsack problem
- optimal solution
- dynamic programming
- worst case
- implicit enumeration
- computational complexity
- np hard
- greedy heuristic
- test problems
- linear programming
- cost function
- bicriteria
- lower bound
- combinatorial optimization problems
- objective function
- linear programming relaxation
- neural network
- simulated annealing
- convex hull
- greedy algorithm
- special case
- search space
- combinatorial optimization
- exact solution
- quadratic programming
- particle swarm optimization
- scheduling problem