We address a single commodity Pickup and Delivery Vehicle Routing Problem from the
literature. A network of customer nodes is given with both travel times and costs. A fleet 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 …

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

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 …

The bin packing problem with precedence constraints (BPP-P) is a recently proposed
variation of the classical bin packing problem (BPP), which corresponds to a basic model …

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 …

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 …

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

In packing problems with fragmentation a set of items of known weight is given, together with
a set of bins of limited capacity; the task is to find an assignment of items to bins such that the …

We consider integer optimization problems where variables can potentially take fractional
values, but this occurrence is penalized in the objective function. This general situation has …