Browsing Industrial Engineering by Subject "Lower bound"
Now showing items 1-3 of 3
-
Bin packing problem with conflicts and item fragmentation
(Elsevier, 2021-02)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 together. Given a set of items each with a ... -
A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
(Elsevier, 2023-08-01)In this paper, we study the Variable-Sized Bin Packing Problem with Conflicts (VSBPPC). In VSBPPC, a set of items each with a certain size has to be packed into bins of various types. Bin types differ in terms of their ... -
Variable-sized bin packing problem with conflicts and item fragmentation
(Elsevier, 2022-01)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 incompatible items using a fleet of heterogenous ...
Share this page