In this paper three heuristic algorithms using the Divide-and-Conquer paradigm are developed and assessed for three integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem (BPP) and Travelling Salesman Problem (TSP). For each case, the algorithm 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问题(D-KP)、Bin包装问题(BPP)和Travelling Salesman问题(TSP ) 。 对于每一种情况,都引入了算法以及数字实验的设计,以便从两个角度实证地确定其性能:计算时间和数字精确度。