Improved branch and bound algorithm with a comparison between different LP solvers

This paper presents a comparison of the effectiveness of different linear programming (LP) solvers when used with a branch-and-bound algorithm to find optimal solutions to mixed integer linear problems (MIP). We compare the performance of an improved implementation of the branch-and-bound algorithm with three different LP solvers in order to evaluate each one. We also compare our implementation with other available solvers, to obtain multiple optimal solutions when they exist. The comparison between those different situations was useful in order to prove the robustness and the efficiency of the developed algorithm.