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, bin-packing and bin-packing-with-leftovers objectives.

This is a direct generalization of the algorithm for rectangle problems.

See rectangle

Tree search with maximal spaces

This algorithm solves the feasibility and knapsack objectives with a single bin. It doesn’t support unloading constraints.

This is a direct generalization of the algorithm for rectangle problems.

See rectangle

References:

• “A beam search algorithm for the biobjective container loading problem” (Araya, Moyano and Sanchez, 2020)

  • https://doi.org/10.1016/j.ejor.2020.03.040

• “A tree search-based heuristic for the three-dimensional single container loading problem” (Guesser, Alves De Queiroz and Miyazawa, 2026)

  • https://doi.org/10.1016/j.ejor.2026.01.039