Hey All,
Looking for some advice on how to handle this problem.
I am needing to identify the most optimal set of items that will 100% fulfill the most baskets. Each basket has its own unique "itemset" or "combination of items".. With this data, I am needing to identify the "itemsets" that fulfill the most baskets based on the input # of unique items we are looking to pull out. For example, if I am looking to identify only 10 items that fulfill the most baskets, I must select "itemsets" that do not exceed the unique combination of 10 items in summary.
My raw data is attached.
Any and all help is greatly appreciated!