An optimal algorithm for rectangle placement
From MaRDI portal
Publication:1306372
Recommendations
- Algorithms for the solution of the problem of placing rectangles in a rectangular area
- An approximation algorithm for sequential rectangle placement
- Optimal placement of rectangles on a plane with fixed objects
- scientific article; zbMATH DE number 22188
- Optimal rectangle packing: an absolute placement approach
- A Local Optimization-based Solution to the Rectangle Layout Problem
- Optimal linear arrangement of a rectangular grid
- Efficient algorithms for the largest rectangle problem
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- A Local Optimization-based Solution to the Rectangle Layout Problem
- A new algorithm for the largest empty rectangle problem
- Efficient algorithms for the largest rectangle problem
- Some experiments with simulated annealing techniques for packing problems
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
Cited in
(29)- Generating optimal T-shape cutting patterns for circular blanks
- Performance Bound for Bottom-Left Guillotine Packing of Rectangles
- Packing solar cells on a roof
- A hybrid genetic algorithm for the two-dimensional single large object placement problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- On the approximability of orthogonal order preserving layout adjustment
- An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
- An optimum placement search algorithm based on extended corner block list.
- An algorithm for polygon placement using a bottom-left strategy
- Few sequence pairs suffice: representing all rectangle placements
- Efficient algorithms for the largest rectangle problem
- Optimal rectangle packing: an absolute placement approach
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A Local Optimization-based Solution to the Rectangle Layout Problem
- An approximation algorithm for sequential rectangle placement
- Algorithms for the solution of the problem of placing rectangles in a rectangular area
- Effect of corner information in simultaneous placement of \(K\) rectangles and tableaux
- Effect of corner information in simultaneous placement of \(k\) rectangles and tableaux
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Estimation of distribution algorithm for two dimensional placement problem
- Enumerating bottom-left stable positions for rectangle placements with overlap
- Space defragmentation for packing problems
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- Optimal placement of rectangles on a plane with fixed objects
- scientific article; zbMATH DE number 1930924 (Why is no real title available?)
- A fast implementation for the 2D/3D box placement problem
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- scientific article; zbMATH DE number 219272 (Why is no real title available?)
This page was built for publication: An optimal algorithm for rectangle placement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306372)
