Login / Signup

A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint.

Andrea BettinelliAlberto CeselliGiovanni Righini
Published in: Ann. Oper. Res. (2010)
Keyphrases
  • variable size
  • fixed size
  • computational complexity
  • bin packing
  • data sets
  • selection algorithm
  • packing problem
  • computer vision
  • lower bound
  • optical flow