>  Term: cutting stock problem
cutting stock problem

Find the best arrangement of shapes on rectangles to minimize waste or the number of rectangles. This is a two-dimensional variant of the bin packing problem. It is NP-complete.

0 0

작성자

  • GeorgeV
  •  (Gold) 1123 포인트
  • 100% positive feedback
© 2024 CSOFT International, Ltd.