Optimal way to cut boards to given length: Difference between revisions
From wikiluntti
(→Parts) |
|||
| Line 1: | Line 1: | ||
== Introduction == | == Introduction == | ||
Problem: Need to cut 6×110 cm similar pieces from 4×200 cm wood. The parts can be glued together, but the gluing should be somehow symmetrical. Also the kerf (the width of the blade) should be considered. | '''Problem''': Need to cut 6×110 cm similar pieces from 4×200 cm wood. The parts can be glued together, but the gluing should be somehow symmetrical. Also the kerf (the width of the blade) should be considered. | ||
'''Problem 2''': We are given a stick of length L. We make cuts such that the longest piece is of length n at most. What are the minimum number of pieces we will get and in how many ways this can be done? https://math.stackexchange.com/questions/2268572/number-of-ways-of-cutting-a-stick-such-that-the-longest-portion-is-of-length-n | |||
== Parts == | == Parts == | ||
Revision as of 14:05, 8 August 2025
Introduction
Problem: Need to cut 6×110 cm similar pieces from 4×200 cm wood. The parts can be glued together, but the gluing should be somehow symmetrical. Also the kerf (the width of the blade) should be considered.
Problem 2: We are given a stick of length L. We make cuts such that the longest piece is of length n at most. What are the minimum number of pieces we will get and in how many ways this can be done? https://math.stackexchange.com/questions/2268572/number-of-ways-of-cutting-a-stick-such-that-the-longest-portion-is-of-length-n
Parts
Optimization
Consider
References
https://bland.ltd/cutlist/ (https://jonathan.overholt.org/projects/cutlist)
