Unbounded knapsack problems with arithmetic weight sequences

被引：4
|
作者：
Deineko, Vladimir G. [2 ]
Woeginger, Gerhard J. [1 ]
机构：
[1] Tech Univ Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
[2] Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, England
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2011年 / 213卷 / 02期
基金：
英国工程与自然科学研究理事会;
关键词：
Combinatorial optimization; Computational complexity; Dynamic programming; Polynomially solvable special case; VARIABLES; ALGORITHM;
D O I：
10.1016/j.ejor.2011.03.028
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We investigate a special case of the unbounded knapsack problem in which the item weights form an arithmetic sequence. We derive a polynomial time algorithm for this special case with running time O(n(8)), where n denotes the number of distinct items in the instance. Furthermore, we extend our approach to a slightly more general class of knapsack instances. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：384 / 387
页数：4
相关论文
共 50 条
12345