Since MCKP is an NP-hard problem, it cannot generally be solved in polynomial time under a reasonable assumption that NP =P.
the goal is to find a subset S(⊂ D) that covers as many conceptual units as possible.