Next: Selected approaches
Up: Case studies
Previous: Case studies
The pagination problem was defined as follows:
- All produced layouts must be
a) as full as possible, and
b) filled with as high-priority material as possible.
- There is more available material than what eventually ends up
on the layout (i.e. selection of material is necessary).
Thus, the two variations of this pagination problem can be described
in terms of knapsack problems as follows:
- The number of bins (pages), is fixed, but there is an abundance
of items (story material) to choose from. The goal is to minimize
empty space and maximize priority value of the material within the
bins.
- The items are fixed and any number of bins can be used. The goal
is to minimize number of bins (pages) required for the whole material.
Krista Lagus