Efficient Algorithms for Maximizing Polygon Packing in a Convex Container

The authors present efficient heuristic algorithms to solve the CG:SHOP 2024 Challenge, which involves packing a set of polygonal items inside a convex container to maximize the total value of the packed items.