An efficient algorithm for the complete set partitioning problem

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


The complete set partitioning problem is the well known set partitioning problem with all possible nonzero binary columns in the constraint matrix. A highly specialized enumerative algorithm, which never requires the explicit maintenance of the constraint matrix, is presented. Computational results, with data reflecting a particular corporate tax payment scenario that can be modelled as a complete set partitioning problem, is also given. © 1983.




Lin, C. H. M., & Salkin, H. M. (1983). An efficient algorithm for the complete set partitioning problem. Discrete Applied Mathematics, 6(2), 149–156.

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