Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem.
Georgiy YaskovTetyana RomanovaIgor S. LitvinchevSergey ShekhovtsovPublished in: ICO (2019)
Keyphrases
- knapsack problem
- optimal solution
- packing problem
- dynamic programming
- maximum profit
- implicit enumeration
- greedy heuristic
- decision variables
- combinatorial optimization problems
- optimization problems
- exact algorithms
- bin packing
- np hard
- mixed integer linear program
- greedy algorithm
- multidimensional knapsack problem
- production planning
- linear programming relaxation
- worst case
- continuous relaxation
- bicriteria
- search space
- cutting plane
- lower bound
- linear programming