A skyline-based heuristic for orthogonal packing rectangles in a circle

DOI10.1016/J.COR.2024.106664MaRDI QIDQ6568481zbMATH OpenFDO

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)

zbMATH Keywords

rectangle packingvariable neighborhood searchskylinecircular container

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An improved best-fit heuristic for the orthogonal strip packing problem
• An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
• An improved typology of cutting and packing problems
• Approximate packing: integer programming models, valid inequalities and nesting
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• Packing circular-like objects in a rectangular container
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search
• The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio

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)