An effective quasi-human based heuristic for solving the rectangle packing problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3990764 (Why is no real title available?)
- A mathematic-physical approach to the satisfiability problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Approximation schemes for covering and packing problems in image processing and VLSI
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Cutting stock problems and solution procedures
- Multidimensional binary search trees used for associative searching
- On genetic algorithms for the packing of polygons
- Optimization by simulated annealing
- Practical Automatic Placement for Standard-Cell Integrated Circuits
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- `` Strong NP-Completeness Results
Cited in
(34)- A fast implementation for the 2D/3D box placement problem
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- Heuristics for solving the 2D rectangle packing area minimization problem based on a dynamic reduction method
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- Stochastic Algorithms: Foundations and Applications
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- An efficient, effective, and robust decoding heuristic for metaheuristics-based layout optimization
- scientific article; zbMATH DE number 5371495 (Why is no real title available?)
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang
- Solving the maximum vertex weight clique problem via binary quadratic programming
- A quasi-human algorithm for solving the three-dimensional rectangular packing problem
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Rectangle packing with a recursive pilot method
- A new heuristic algorithm for rectangle packing
- A least wasted first heuristic algorithm for the rectangular packing problem
- The maximum diversity assortment selection problem
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- An EDA for the 2D knapsack problem with guillotine constraint
- A population heuristic for constrained two-dimensional non-guillotine cutting
- A reference length approach for the 3D strip packing problem
- A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
- A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
- New heuristic and interactive approaches to 2D rectangular strip packing
- An efficient deterministic heuristic for two-dimensional rectangular packing
- Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings
- A new heuristic recursive algorithm for the strip rectangular packing problem
- Performance testing of rectangular parts-nesting heuristics
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
This page was built for publication: An effective quasi-human based heuristic for solving the rectangle packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847202)
