Faster FPTASes for counting and random generation of Knapsack solutions.

Romeo Rizzi Alexandru I. Tomescu

Published in: Inf. Comput. (2019)

Keyphrases

optimal solution
knapsack problem
feasible solution
upper bound
randomly generated
solution quality
dynamic programming
cost function
efficient solutions
case based reasoning
real time
multi objective
data structure
knowledge base
e learning
feature selection
information retrieval
data mining