The Multi-Level Bin Packing problem and its variants are some of the most popular combinatorial optimization problems. They have a wide range of real-life applications yet, they are some of the harder problems we know of. In this paper we solve the Multi-Level Bin Packing Problem and a variant of it, Multi-Level Bin Packing Problem with Conflict Constraints, using Integer Programming. We propose two Integer Programming models, a standard one and one with additional flow optimizations. We hypothesized that the second model will have a smaller solution space and consequently an improved performance for both of the problems. However, we find that the second model’s performance is worse and that although it may have a smaller solution space, the comparison of the BnB nodes points towards inconclusiveness.