A polynomially solvable special case of the unbounded knapsack problem

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

12 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)13-16
Journal / PublicationOperations Research Letters
Volume29
Issue number1
Publication statusPublished - Aug 2001
Externally publishedYes

Abstract

A special case of the unbounded knapsack problem that is characterized by a set of simple inequalities that relate item weights to item costs is considered. An algorithm for this special case with time complexity linear in the number of items was proposed and presented.

Research Area(s)

  • Combinatorial optimization, Computational complexity, Integer programming, Knapsack, Polynomial time algorithm

Citation Format(s)

A polynomially solvable special case of the unbounded knapsack problem. / Zukerman, Moshe; Jia, Long; Neame, Timothy et al.
In: Operations Research Letters, Vol. 29, No. 1, 08.2001, p. 13-16.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review