Pages that link to "Item:Q2465953"
From MaRDI portal
The following pages link to A polynomial algorithm for one problem of guillotine cutting (Q2465953):
Displaying 5 items.
- Characterization and modelling of guillotine constraints (Q930945) (← links)
- Stock cutting to minimize cutting length (Q1266563) (← links)
- Minimum convex partition of polygonal domains by guillotine cuts (Q1380781) (← links)
- An FPT algorithm for orthogonal buttons and scissors (Q2203593) (← links)
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409) (← links)