Minimum tiling of a rectangle by squares
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
- An exact approach to the strip-packing problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Exact algorithms for the two-dimensional guillotine knapsack
- Exploiting erraticism in search
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Integer programming approaches to the travelling salesman problem
- On the two-dimensional knapsack problem
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- Partitioning a square into rectangles: NP-Completeness and approximation algorithms
- Partitioning procedures for solving mixed-variables programming problems
- Rectangles as sums of squares
- Tiling a rectangle with the fewest squares
- Two-dimensional bin packing problems
Cited in
(2)
This page was built for publication: Minimum tiling of a rectangle by squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730580)