Bounds for Two-Dimensional Cutting
From MaRDI portal
Recommendations
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- scientific article; zbMATH DE number 1094768
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
Cited in
(14)- Packing problems
- Computing closely matching upper and lower bounds on textile nesting problems
- An algorithm for the 2D guillotine cutting stock problem
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- LP bounds in various constraint programming approaches for orthogonal packing
- Queue-constrained packing: a vehicle ferry case study
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- One-dimensional relaxations and LP bounds for orthogonal packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A new upper bound for unconstrained two-dimensional cutting and packing
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- Simplest optimal cutting patterns for equal rectangles
This page was built for publication: Bounds for Two-Dimensional Cutting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221736)
