홈 > 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.
- 품사: noun
- 분야/도메인: 컴퓨터 과학
- 카테고리: Algorithms & data structures
- Government Agency: NIST
0
작성자
- GeorgeV
- 100% positive feedback