New trends in exact algorithms for the 0-1 knapsack problem.
Silvano MartelloDavid PisingerPaolo TothPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- exact algorithms
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- vehicle routing problem with time windows
- dynamic programming
- np hard
- multidimensional knapsack problem
- greedy algorithm
- bicriteria
- benders decomposition
- linear programming relaxation
- continuous relaxation
- cutting plane
- implicit enumeration
- greedy heuristic
- state space