New lower bounds for the three-dimensional finite bin packing problem.
Marco A. BoschettiPublished in: Discret. Appl. Math. (2004)
Keyphrases
- lower bound
- three dimensional
- upper bound
- branch and bound algorithm
- branch and bound
- lower bounding
- lower and upper bounds
- objective function
- optimal solution
- x ray
- d objects
- worst case
- virtual reality
- upper and lower bounds
- np hard
- optimal cost
- finite number
- quadratic assignment problem
- depth map
- vc dimension
- human body
- multi view
- sample complexity
- packing problem
- online algorithms
- online learning
- optimization problems
- image sequences