Minimum tiling of a rectangle by squares
From MaRDI portal
Publication:1730580
DOI10.1007/s10479-017-2746-2zbMath1411.90056OpenAlexW2782326306MaRDI QIDQ1730580
André Gustavo dos Santos, Michele Monaci
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.locus.ufv.br/handle/123456789/22903
Numerical mathematical programming methods (65K05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Rectangles as sums of squares
- Partitioning procedures for solving mixed-variables programming problems
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Partitioning a square into rectangles: NP-Completeness and approximation algorithms
- Tiling a rectangle with the fewest squares
- An Exact Approach to the Strip-Packing Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Integer programming approaches to the travelling salesman problem
- An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
- Exploiting Erraticism in Search
This page was built for publication: Minimum tiling of a rectangle by squares
