  We describe the heuristics used by the Shadoks team in the CG:SHOP 2024
Challenge. Each instance consists of a convex polygon called container and a
multiset of items, where each item is a simple polygon and has an associated
value. The goal is to pack some of the items inside the container using
translations, in order to maximize the sum of their values. Our strategy
consists of obtaining good initial solutions and improving them with local
search. To obtain the initial solutions we used integer programming and a
carefully designed greedy approach.
