A polynomially solvable special case of the unbounded knapsack problem

M. Zukerman, L. Jia, T. Neame, G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    10 Citations (Scopus)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)13-16
    JournalOperations Research Letters
    Volume29
    Issue number1
    DOIs
    Publication statusPublished - 2001

    Fingerprint Dive into the research topics of 'A polynomially solvable special case of the unbounded knapsack problem'. Together they form a unique fingerprint.

  • Cite this