A lower bound for the non-oriented two-dimensional bin packing problem.
Mauro Dell'AmicoSilvano MartelloDaniele VigoPublished in: Discret. Appl. Math. (2002)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- worst case
- three dimensional
- np hard
- optimal solution
- objective function
- machine learning
- packing problem
- upper and lower bounds
- lagrangian relaxation
- sample complexity
- lower bounding
- multi dimensional
- vc dimension
- precedence constraints
- online algorithms
- branch and bound method