Dp 294 en
Skočit na navigaci
Skočit na vyhledávání
Author: Josef Mrázik
The paper presents an algorithm for solving 3D-Bin Packing problem with speci�c constraints. The task is to place maximum ammount of box-shaped items into a single bounded container, while the sequence of items has not to be changed. The task is NP-Hard and very hard to solve in praxis. Deterministic algorithm based od Branch and bound method is presented. The computational experiments were done to prove the functionality.