A new lower bound for the non-oriented two-dimensional bin-packing problem.
François ClautiauxAntoine JougletJoseph El HayekPublished in: Oper. Res. Lett. (2007)
Keyphrases
- lower bound
- upper bound
- three dimensional
- branch and bound
- branch and bound algorithm
- np hard
- upper and lower bounds
- lower and upper bounds
- worst case
- packing problem
- lower bounding
- optimal solution
- objective function
- competitive ratio
- sample complexity
- vc dimension
- multi dimensional
- branch and bound method
- bin packing
- lagrangian relaxation
- integer programming
- linear programming