A polynomial algorithm for one problem of guillotine cutting
From MaRDI portal
Recommendations
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
- scientific article; zbMATH DE number 2146649
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Characterization and modelling of guillotine constraints
Cites work
- scientific article; zbMATH DE number 3183598 (Why is no real title available?)
- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
- A typology of cutting and packing problems
- Computing Two-Dimensional Integer Hulls
- Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
- On polynomial solvability of two multiprocessor scheduling problems
- The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
Cited in
(8)- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
- scientific article; zbMATH DE number 2106794 (Why is no real title available?)
- scientific article; zbMATH DE number 2146649 (Why is no real title available?)
- Characterization and modelling of guillotine constraints
- scientific article; zbMATH DE number 166938 (Why is no real title available?)
- scientific article; zbMATH DE number 1784423 (Why is no real title available?)
- An FPT algorithm for orthogonal buttons and scissors
This page was built for publication: A polynomial algorithm for one problem of guillotine cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465953)