Lower bounds and heuristic algorithms for the ki-partitioning problem

Citations of this article
Mendeley users who have this article in their library.
Get full text


We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of values in a subset is minimized, and the number of values in each subset does not exceed the corresponding limit. The problem is related to scheduling and bin packing problems. We give combinatorial lower bounds, reduction criteria, constructive heuristics, a scatter search approach, and a lower bound based on column generation. The outcome of extensive computational experiments is presented. © 2004 Elsevier B.V. All rights reserved.




Dell’Amico, M., Iori, M., Martello, S., & Monaci, M. (2006). Lower bounds and heuristic algorithms for the ki-partitioning problem. European Journal of Operational Research, 171(3), 725–742. https://doi.org/10.1016/j.ejor.2004.09.002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free