Department of Mathematics, M.M.P.G. College, Fatehabad, Haryana, India
Online published on 21 November, 2017.
Subset problems (Set Partitioning packing and covering) are formal models for many practical optimizations how the items in a set (S) can be partitioned into smaller subsets. All the items in S must be contained in one and only one partition. The problems which are related to theses types of problems are set packing problems. All items must be contained in zero or one partition.
