Exact Counting and Sampling of Optima for the Knapsack Problem.
Jakob BossekAneta NeumannFrank NeumannPublished in: LION (2021)
Keyphrases
- knapsack problem
- optimal solution
- combinatorial optimization problems
- optimization problems
- exact algorithms
- test problems
- np hard
- greedy algorithm
- multidimensional knapsack problem
- dynamic programming
- linear programming relaxation
- global optimum
- exact solution
- np hard problems
- evolutionary algorithm
- bicriteria
- branch and bound
- random sampling
- greedy heuristic
- maximum profit
- special case
- implicit enumeration
- lower bound
- linear programming
- efficient solutions
- random variables
- optimization algorithm
- continuous relaxation
- randomly generated test instances