The Coin-Exchange Problem of Frobenius

Maximizing space utilization in unit-load warehouses.

“…Each solution is a cutting pattern of H, and we denote the set of all solutions by η = (n ij ). In combinatorics, this problem is known as the money changing problem (Beck and Robins, 2007). To solve it, we use the algorithm presented in Bocker and Liptak (2007).…”