English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 95844/126434 (76%)
Visitors : 31568036      Online Users : 460
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/71423
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/71423

    Title: Determining k-Most Demanding Products with Maximum Expected Number of Total Customers
    Authors: 陳良弼
    J.L. Koh
    C.Y. Lin
    Contributors: 資科系
    Date: 2013
    Issue Date: 2014-11-13 17:23:58 (UTC+8)
    Abstract: In this paper, a problem of production plans, named k-most demanding products (k-MDP) discovering, is formulated. Given a set of customers demanding a certain type of products with multiple attributes, a set of existing products of the type, a set of candidate products that can be offered by a company, and a positive integer k, we want to help the company to select k products from the candidate products such that the expected number of the total customers for the k products is maximized. We show the problem is NP-hard when the number of attributes for a product is 3 or more. One greedy algorithm is proposed to find approximate solution for the problem. We also attempt to find the optimal solution of the problem by estimating the upper bound of the expected number of the total customers for a set of k candidate products for reducing the search space of the optimal solution. An exact algorithm is then provided to find the optimal solution of the problem by using this pruning strategy. The experiment results demonstrate that both the efficiency and memory requirement of the exact algorithm are comparable to those for the greedy algorithm, and the greedy algorithm is well scalable with respect to k.
    Relation: IEEE Transactions on Knowledge and Data Engineering, 25(8), 1732-1747
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1109/TKDE.2012.53
    DOI: 10.1109/TKDE.2012.53
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback