An empirical analysis of exact algorithms for the unbounded knapsack problem.
Henrique BeckerLuciana S. BuriolPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- exact algorithms
- knapsack problem
- approximation algorithms
- benchmark instances
- exact solution
- vehicle routing problem with time windows
- heuristic methods
- combinatorial problems
- benders decomposition
- combinatorial optimization
- nonlinear programming
- computational problems
- combinatorial optimization problems
- max sat
- metaheuristic
- heuristic search
- particle swarm optimization
- optimization problems
- information retrieval