Login / Signup

Lower bounds for three-dimensional multiple-bin-size bin packing problems.

Ramón Alvarez-ValdésFrancisco ParreñoJosé Manuel Tamarit
Published in: OR Spectr. (2015)
Keyphrases
  • lower bound
  • three dimensional
  • packing problem
  • variable sized
  • cutting stock
  • upper bound
  • bin packing
  • lot sizing
  • branch and bound algorithm
  • np hard
  • lower and upper bounds