English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94586/125118 (76%)
Visitors : 30543217      Online Users : 148
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/61684
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/61684

    Title: A Constructive Periodicity Bound for the Unbounded Knapsack Problem
    Authors: 唐揆
    Huang, Ping H.;Tang, Kwei
    Contributors: 企管系
    Keywords: Combinatorial optimization;Integer programming;Knapsack problem;Periodicity
    Date: 2012-09
    Issue Date: 2013-11-14 11:54:33 (UTC+8)
    Abstract: A classic bound for periodicity was defined by Kellerer et al. (2004) [5] in their comprehensive book on knapsack problems. We propose an almost-tight bound which improves on the classic bound in all instances.
    Relation: Operations Research Letters, 40(5) , 329-331
    Data Type: article
    DOI 連結: http://dx.doi.org/http://dx.doi.org/10.1016/j.orl.2012.05.001
    DOI: 10.1016/j.orl.2012.05.001
    Appears in Collections:[企業管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    329331.pdf189KbAdobe PDF1003View/Open

    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