• Title of article

    A polynomially solvable special case of the unbounded knapsack problem

  • Author/Authors

    Moshe Zukerman، نويسنده , , Long Jia، نويسنده , , Timothy Neame، نويسنده , , Gerhard J. Woeginger، نويسنده ,

  • Issue Information
    دوماهنامه با شماره پیاپی سال 2001
  • Pages
    4
  • From page
    13
  • To page
    16
  • Keywords
    integer programming , combinatorial optimization , Polynomial time algorithm , Computationalcomplexity , Knapsack
  • Journal title
    Operations Research Letters
  • Serial Year
    2001
  • Journal title
    Operations Research Letters
  • Record number

    137305

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=137305