An exact approach for the 0-1 knapsack problem with setups.
Federico Della CroceFabio SalassaRosario ScatamacchiaPublished in: Comput. Oper. Res. (2017)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- test problems
- optimization problems
- dynamic programming
- multidimensional knapsack problem
- greedy algorithm
- linear programming relaxation
- bicriteria
- np hard problems
- exact algorithms
- np hard
- maximum profit
- heuristic solution
- cutting plane
- greedy heuristic
- computational complexity
- exact solution
- objective function
- genetic algorithm
- implicit enumeration
- neural network