box algorithms¶
See box for the input/output format and CLI usage of this solver.
Tree search¶
This algorithm solves the feasibility, knapsack, open-dimension-x, open-dimension-y, open-dimension-z, bin-packing and bin-packing-with-leftovers objectives.
This is a direct generalization of the tree search for rectangle to three dimensions: a single item is packed at each stage, against the skyline of the items already packed.
Tree search with maximal spaces¶
This algorithm solves the feasibility and knapsack objectives with a single bin.
It is a tree search algorithm where a block of items is packed at each stage, in a corner of the maximal empty spaces of the bin. The tree search with maximal spaces for rectangle is its two-dimensional version.
Dual feasible functions¶
This algorithm computes a bound for the bin-packing, feasibility and knapsack objectives, for instances with a single bin type.
It is the generalization to three dimensions of the dual feasible functions for rectangle.
Trivial bounds¶
Closed-form bounds, computed for every instance: a volume-based fractional bound for the knapsack objective, a volume-based number of bins for the bin-packing objective, and bounds from the volume and the dimensions of the items for the open dimension objectives.