Container loading problems can be interpreted as geometric
assignment problems in which three-dimensional small items
(called cargo) have to be assigned (packed into)to three-dimensional, rectangular (cubic) large objects (called containers) such that a given objective function is optimized and two basic geometric feasibility conditions hold, i.e.