Abstract

TORRICO, Lucio. Heuristic algorithm for partition problem. Rev Inv Tec [online]. 2015, vol.3, n.2, pp. 40-47. ISSN 2306-0522.

In general, exact solutions to the problem of partition are obtained through algorithms intractable because the problem is NP. Besides a famous pseudo-polynomial algorithm there are, however, a number of polynomial heuristic algorithms that find approximations to an exact solution to the problem (seeing it as a subset-sum problem case). We present a heuristic algorithm that implements the idea of ordering the data anddo partial sums for get new elements, with growth control of the number of columns (for the dynamic programming algorithm, which we changed a bit to work with non-sequential numbers). This algorithm seems toperform quite wellfor experiments

Keywords : partition problem; pseudo-polynomial algorithm.