Application and Assessment of the Divide-and-Conquer method on some Integer Optimization Problems

In this paper the Divide-and-Conquer method is applied and assessed to three integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem (BPP) and Travelling Salesman Problem (TSP). For each case, the method is introduced, together with the design of numerical experiments, in order to empirically establish its performance from both points of view: its computational time and its numerical accuracy.