A greedy-based approximation algorithm and an exhaustive search algorithm for the kMMP product selection problem. The kMMP problem aim to find the k most marketable products under a given market condition.
This was used in my paper: Product Selection Problem: Improve Market Share by Learning Consumer Behavior, Silei Xu and John C.S Lui, in KDD 2014.