A polynomially solvable special case of the unbounded knapsack problem

被引：14
|
作者：
Zukerman, M [1 ]
Jia, L
Neame, T
Woeginger, GJ
机构：
[1] Univ Melbourne, EEE Dept, ARC Special Res Ctr Ultra Broadband Informat Netw, Melbourne, Vic 3010, Australia
[2] Graz Tech Univ, Inst Math B, A-8010 Graz, Austria
[3] Univ Enschede, Dept Math, NL-7500 AE Enschede, Netherlands
来源：
OPERATIONS RESEARCH LETTERS | 2001年 / 29卷 / 01期
关键词：
knapsack; combinatorial optimization; integer programming; polynomial time algorithm; computational complexity;
D O I：
10.1016/S0167-6377(01)00076-1
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider a special case of the unbounded knapsack problem that is characterized by a set of simple inequalities that relate item weights to item costs. We present an algorithm for this special case with time complexity linear in the number of items. (C) 2001 Published by Elsevier Science B.V.
引用
收藏
页码：13 / 16
页数：4
相关论文
共 50 条
12345