首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Algorithms for the bounded set-up knapsack problem
Institution:1. Department of Statistical Sciences and Operations Research, Virginia Commonwealth University, P.O. Box 843083, 1001 West Main Street, Richmond, VA 23284, United States;2. Department of Computer Science, University of Illinois, Thomas M. Siebel Center, 201 N. Goodwin Avenue (MC-258) Urbana, IL 61801-2302, United States
Abstract:The Bounded Set-up Knapsack Problem (BSKP) is a generalization of the Bounded Knapsack Problem (BKP), where each item type has a set-up weight and a set-up value that are included in the knapsack and the objective function value, respectively, if any copies of that item type are in the knapsack. This paper provides three dynamic programming algorithms that solve BSKP in pseudo-polynomial time and a fully polynomial-time approximation scheme (FPTAS). A key implication from these results is that the dynamic programming algorithms and the FPTAS can also be applied to BKP. One of the dynamic programming algorithms presented solves BKP with the same time and space bounds of the best known dynamic programming algorithm for BKP. Moreover, the FPTAS improves the worst-case time bound for obtaining approximate solutions to BKP as compared to using FPTASs designed for BKP or the 0-1 Knapsack Problem.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号