New lower bounds for the three-dimensional orthogonal bin packing problem.
Chung-Shou LiaoChia-Hong HsuPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- lower bound
- three dimensional
- upper bound
- branch and bound algorithm
- np hard
- branch and bound
- lower and upper bounds
- optimal solution
- x ray
- upper and lower bounds
- objective function
- randomly generated problems
- lower bounding
- multi view
- worst case
- d objects
- optimal cost
- sample complexity
- exact solution
- linear programming relaxation
- virtual reality
- precedence constraints
- surface reconstruction
- theoretical analysis
- linear programming
- face recognition