An optional extension of VectorPacking allowing knapsack process.
Lighter but faster version of BinPacking that does not provide the knapsack filtering
The list of bins can be optionally maintain as a heap in order that only the bins with the maximum load slack are considered in the propagation of rule 1: binLoad = sumItemSizes - sumOtherBinLoads call attachHeapDecorator() to the VectorPackingPropagator object
Lighter but faster version of a multi dimension vector packing that does not provide the knapsack filtering enforce: 1) globally: sum(binLoads) == sumItemSizes 2) on each bin: binLoad = sumAssignedItemSizes
Copyright © 2016 University of Nice-Sophia Antipolis. All Rights Reserved.