New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation.
Jacques CarlierFrançois ClautiauxAziz MoukrimPublished in: Comput. Oper. Res. (2007)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- optimal solution
- three dimensional
- objective function
- packing problem
- worst case
- upper and lower bounds
- lower and upper bounds
- lower bounding
- fixed number
- quadratic assignment problem
- genetic algorithm
- position and orientation
- reduction method
- optimal cost