A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing.
Gábor GalambosPublished in: Acta Cybern. (1991)
Keyphrases
- bin packing
- lower bound
- packing problem
- upper bound
- branch and bound algorithm
- assembly line balancing
- search tree
- three dimensional
- graph colouring
- branch and bound
- np hard
- cutting stock
- optimal solution
- worst case
- objective function
- lower and upper bounds
- hough transform
- line segments
- multi dimensional
- database
- minimum bounding
- database systems
- integer programming
- sufficiently accurate
- genetic algorithm