An empirical analysis of exact algorithms for the unbounded knapsack problem.
Henrique BeckerLuciana S. BuriolPublished in: CoRR (2019)
Keyphrases
- exact algorithms
- knapsack problem
- exact solution
- approximation algorithms
- benchmark instances
- vehicle routing problem with time windows
- combinatorial optimization
- computational problems
- heuristic methods
- benders decomposition
- combinatorial problems
- combinatorial optimization problems
- optimization problems
- max sat
- np hard
- machine learning
- nonlinear programming
- evolutionary algorithm
- np complete
- dynamic programming
- special case
- optimal solution