Data set generation for rectangular placement problems
From MaRDI portal
Publication:5945856
DOI10.1016/S0377-2217(00)00263-0zbMath0990.90104OpenAlexW1969649173MaRDI QIDQ5945856
Christine L. Valenzela, Pearl Y. Wang
Publication date: 14 October 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00263-0
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (14)
Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms ⋮ 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems ⋮ A hybrid heuristic algorithm for the 2D variable-sized bin packing problem ⋮ An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem ⋮ An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation ⋮ A simple randomized algorithm for two-dimensional strip packing ⋮ The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview ⋮ Rectangle packing with a recursive pilot method ⋮ A skyline heuristic for the 2D rectangular packing and strip packing problems ⋮ Reactive GRASP for the strip-packing problem ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio ⋮ The maximum diversity assortment selection problem ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
Uses Software
Cites Work
This page was built for publication: Data set generation for rectangular placement problems
