A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem.
Mehdi SerairiMohamed HaouariPublished in: RAIRO Oper. Res. (2018)
Keyphrases
- experimental study
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- three dimensional
- np hard
- experimental evaluation
- objective function
- lower and upper bounds
- optimal cost
- upper and lower bounds
- lagrangian relaxation
- theoretical analysis
- vc dimension
- lower bounding
- packing problem
- randomly generated problems
- optimal solution
- linear programming
- bin packing
- learning algorithm
- data sets