1 paper
Aristide Grange, Imed Kacem, Sébastien Martin
We introduce the strongly NP-complete pagination problem, an extension of BIN PACKING where packing together two items may make them occupy less volume than the sum of their indivi…