We survey the main formulations and solution methods for two-dimensional orthogonal
cutting and packing problems, where both items and bins are rectangles. We focus on exact …

We study an extension of the classical Bin Packing Problem, where each item consumes the
bin capacity during a given time window that depends on the item itself. The problem asks …

The two-dimensional bin packing problem calls for packing a set of rectangular items into a
minimal set of larger rectangular bins. Items must be packed with their edges parallel to the …

We address the one-dimensional bin packing problem with concave loading cost (BPPC),
which commonly arises in less-than-truckload shipping services. Our contribution is twofold …

Motivated by a leading Chinese multinational manufacturer's practical air cargo logistics
activities, we investigate an air cargo partitioning problem with a piecewise linear cost …

Biodiversity monitoring is valuable for reversing the global trend of biodiversity loss. The
typical indicators in biodiversity monitoring are wild animals like vertebrates which can be …

The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a
minimal set of larger rectangular bins. Items must be packed with their edges parallel to the …

Multi container loading problem have been considered in this research for optimization of its
packing pattern to yield maximum utilization of the container volume by satisfying the …

Bin Packing Problem is a well-studied problem in combinatorial optimization. One of its
important variants is the Two-Dimensional Bin Packing Problem (2BPP). It consists in …