Programming of a stack algorithm for optimal shipping

We need a stack algorithm for shipping purposes. The program is needed for the calculation of multiples or sets of articles. Allowed maximal dimensions (the smaller, the better): Size 1: smaller than 235 mm x 125 mm x 5 mm Size 2: smaller than 235 mm x 125 mm x 10 mm Size 3: smaller than 353 mm x 250 mm x 20 mm Size 4: smaller than 353 mm x 250 mm x 50 mm Size 5: smaller than 353 mm x 250 mm x 100 mm Size 6: smaller than 1200 mm x 600 mm x 600 mm Stacking of a multiple of the same article: Example 1: Shipment of: Item size: 51 mm x 19 mm x 4 mm Quantity: 10 pcs -> Smallest shipment volume: 102 mm x 95 mm x 4 mm Example 2: Shipment of: Item size: 67 mm x 26 mm x 7 mm Quantity: 50 pcs -> Smallest shipment volume: 335 mm x 130 mm x 14 mm Example 3: Shipment of: Item size: 177 mm x 19 mm x 21 mm Quantity: 20 pcs -> Smallest shipment volume: 190 mm x 177 mm x 42 mm Stacking of a multiple of different articles: Example 4: Shipment of: Item size 1: 25 mm x 25 mm x 6 mm, Quantity: 100 pcs Item size 2: 6 mm x 6 mm x 2 mm, Quantity: 100 pcs -> Smallest shipment volume: 300 mm x 225 mm x 8 mm Example 5: Shipment of: Item size 1: 115 mm x 35 mm x 24 mm, Quantity: 30 pcs Item size 2: 65 mm x 40 mm x 24 mm, Quantity: 5 pcs Item size 3: 300 mm x 50 mm x 49 mm, Quantity: 1 pcs -> Smallest shipment volume: 345 mm x 249 mm x 49 mm Example 6: Shipment of: Item size 1: 9 mm x 9 mm x 2 mm, Quantity: 2 pcs Item size 2: 90 mm x 35 mm x 12 mm, Quantity: 5 pcs Item size 3: 310 mm x 5 mm x 5 mm, Quantity: 1 pcs Item size 1: 125 mm x 125 mm x 2 mm, Quantity: 7 pcs Item size 2: 3 mm x 3 mm x 2 mm, Quantity: 9 pcs Item size 3: 200 mm x 20 mm x 3 mm, Quantity: 1 pcs -> Smallest shipment volume: 310 mm x 150 mm x 14 mm Preferred Language is Python. No GUI is needed. Just code development.