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.

翻译：本文对三个整数优化问题应用和评估了“分而治之”方法:D-KP、Bin包装问题和Traveling Salesman问题。 每种情况都采用了这一方法,同时设计了数字实验,以便从两个角度,即计算时间和数字精确度,实证地确定其性能。