Login / Signup

Cardinality constrained bin‐packing problems.

Hans KellererUlrich Pferschy
Published in: Ann. Oper. Res. (1999)
Keyphrases
  • packing problem
  • cutting stock
  • bin packing
  • lot sizing
  • integer programming
  • pattern recognition
  • cardinality constraints
  • dynamic programming
  • np complete
  • constraint satisfaction
  • mixed integer linear program