Shadoks Approach to Knapsack Polygonal Packing
<|reference_start|>Shadoks Approach to Knapsack Polygonal Packing: 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.<|reference_end|>
@article{da fonseca2024shadoks,
    title={Shadoks Approach to Knapsack Polygonal Packing},
    author={Guilherme D. da Fonseca and Yan Gerard},
    journal={arXiv preprint arXiv:2403.20123},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.20123},
    primaryClass={cs.CG}
}