Login / Signup

Determining an upper bound for a class of rectangular packing problems.

Kathryn A. Dowsland
Published in: Comput. Oper. Res. (1985)
Keyphrases
  • packing problem
  • upper bound
  • lower bound
  • bin packing
  • integer programming
  • worst case
  • cutting stock
  • branch and bound algorithm
  • arbitrary shaped
  • feature extraction
  • special case
  • np complete
  • error probability