The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds.
Marco A. BoschettiAristide MingozziPublished in: 4OR (2003)
Keyphrases
- lower and upper bounds
- lower bound
- upper bound
- packing problem
- three dimensional
- lower bounding
- upper and lower bounds
- branch and bound algorithm
- branch and bound
- lagrangian relaxation
- valid inequalities
- multi dimensional
- optimal solution
- np hard
- objective function
- bin packing
- data structure
- knapsack problem
- finite number
- linear programming relaxation
- data sets