A skyline-based heuristic for orthogonal packing rectangles in a circle
From MaRDI portal
Publication:6568481
DOI10.1016/J.COR.2024.106664MaRDI QIDQ6568481FDOQ6568481
Authors: Tai Zhang, Runqin Wang, Hao Zhang, Qiang Liu, Lijun Wei 
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- An improved typology of cutting and packing problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- Packing circular-like objects in a rectangular container
- 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
- An improved best-fit heuristic for the orthogonal strip packing problem
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- Approximate packing: integer programming models, valid inequalities and nesting
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
This page was built for publication: A skyline-based heuristic for orthogonal packing rectangles in a circle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568481)
