Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount

This paper aims to introduce an optimal bundle search problem (OBSP) which must be solved for online recommendation system to provide an optimized service considering pairwise discount and delivery cost. We propose a mathematical formulation with numerical example for the (OBSP) and analyzed the complexity of the problem.