Improved dynamic programming and approximation results for the knapsack problem with setups.
Ulrich PferschyRosario ScatamacchiaPublished in: Int. Trans. Oper. Res. (2018)
Keyphrases
- knapsack problem
- dynamic programming
- linear programming relaxation
- combinatorial optimization problems
- test problems
- multidimensional knapsack problem
- multiple objectives
- greedy algorithm
- exact algorithms
- bicriteria
- optimal solution
- multistage
- optimization problems
- np hard problems
- linear programming
- cutting plane
- approximation algorithms
- upper bound
- np hard
- single machine
- search algorithm
- implicit enumeration
- continuous relaxation
- objective function
- lagrangian relaxation
- linear program
- optimal policy
- lp relaxation