We study pseudo-polynomial formulations for the classical bin packing and cutting stock
problems. We first propose an overview of dominance and equivalence relations among the …

This paper addresses the challenge of managing uncertainty in the daily capacity planning
of a terminal in a corridor-based logistics system. Corridor-based logistics systems facilitate …

This paper addresses a tactical joint inventory and transportation planning problem for
multiple items with deterministic and time-varying demand, considering different …

Bin packing problem (BPP) is one of the fastest-growing research issues within the field of
combinatorial optimization. Over the last years, several studies carried out various BPP …

The bin packing problem is one of the most studied combinatorial optimization problem. This
paper proposes two novel bin packing problem settings with many practical applications, in …

In this paper, we study the Variable-Sized Bin Packing Problem with Conflicts and Item
Fragmentation (VSBPPC-IF) that has applications such as (i) the delivery planning of …

In this paper, we study the Bin Packing Problem with Conflicts and Item Fragmentation
(BPPC-IF) which has applications in the delivery and storage of items that cannot be packed …

The bin packing problem (BPP) is a classic combinatorial optimization problem with several
variations. The BPP with conflicts (BPPCs) is not a well-investigated variation. In the BPPC …

This paper addresses the Generalized Bin Packing Problem with Incompatible Categories
(GBPPIC), a challenging optimization problem related to last-mile distribution in large cities …

Abstract Bin Packing Problem with Conflicts and Item Fragmentation (BPPC-IF) is a variant
of the classical bin packing problem in which fragments of the same item can be packed in …