상세검색
최근 검색어 전체 삭제
다국어입력
즐겨찾기0
157476.jpg
학술저널

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.

1. Introduction

2. Literature Reviews

3. Mathematical Formulation

4. Results of Problem P

로딩중