Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...

Abstract: This article presents current state of knowledge about the optimization of the last stages of the supply chain. Two main problem types with corresponding variants are presented and the most ...