A note on a two dimensional knapsack problem with unloading constraints.
Jefferson Luiz Moisés da SilveiraEduardo Candido XavierFlávio Keidi MiyazawaPublished in: RAIRO Theor. Informatics Appl. (2013)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- decision variables
- optimal solution
- optimization problems
- dynamic programming
- test problems
- binary variables
- exact algorithms
- np hard
- multidimensional knapsack problem
- greedy algorithm
- integer variables
- linear relaxation
- three dimensional
- greedy heuristic
- np hard problems
- heuristic solution
- lp relaxation
- bicriteria
- maximum profit
- linear programming problems
- cutting plane
- constrained optimization
- linear programming relaxation
- constraint programming
- column generation
- constraint satisfaction