An Exact Algorithm for the 0- 1 Collapsing Knapsack Problem.
Didier FayardGérard PlateauPublished in: Discret. Appl. Math. (1994)
Keyphrases
- knapsack problem
- exact algorithms
- combinatorial optimization problems
- optimal solution
- shortest path problem
- dynamic programming
- np hard
- optimization problems
- branch and bound algorithm
- test problems
- multidimensional knapsack problem
- greedy algorithm
- np hard problems
- column generation
- heuristic solution
- linear programming relaxation
- integer programming
- bicriteria
- greedy heuristic
- continuous relaxation
- maximum profit
- machine learning
- cutting plane
- decision variables
- multiple objectives
- multi objective
- implicit enumeration
- special case
- neural network
- randomly generated test instances