Expand description
§pagination-packing
A Rust crate for efficiently solving bin-packing problems with overlap: so-called “pagination” problems.
The problem is described in the paper Algorithms for the Bin Packing Problem with Overlapping Items (by Aristide Grange, Imed Kacem, and Sébastien Martin), as well as the “Overload and Remove” algorithm implemented here.
Structs§
- Assigned
Tiles - A collection of references to tiles.
Functions§
- overload_
and_ remove - Packs
Tiles (composed of comparableSymbols) into pages (essentially[Symbol; page_size]). Returns a vector of “assignments”: