政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/71423
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 20 |  Items with full text/Total items : 90058/119991 (75%)
Visitors : 24086057      Online Users : 1805
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
    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 link: http://dx.doi.org/10.1109/TKDE.2012.53
    DOI: 10.1109/TKDE.2012.53
    Appears in Collections:[Department of Mathematical Sciences] Periodical Articles

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML875View/Open


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback