A new exact approach for the 0-1 Collapsing Knapsack Problem.
Federico Della CroceFabio SalassaRosario ScatamacchiaPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- optimization problems
- optimal solution
- exact algorithms
- np hard
- test problems
- bicriteria
- linear programming relaxation
- greedy algorithm
- np hard problems
- greedy heuristic
- cutting plane
- multidimensional knapsack problem
- multiple objectives
- traveling salesman problem
- special case
- neural network
- implicit enumeration
- continuous relaxation
- higher dimensional
- machine learning