Counting and Enumerating Independent Sets with Applications to Knapsack Problems.

Frank Gurski Carolin Rehs

Published in: CoRR (2017)

Keyphrases

knapsack problem
combinatorial optimization problems
optimal solution
np hard
optimization problems
test problems
dynamic programming
linear programming relaxation
np hard problems
production planning
cutting plane
bicriteria
continuous relaxation
exact algorithms
greedy algorithm
neural network
maximum profit