A note on dominance relation in unbounded knapsack problems
From MaRDI portal
Publication:1180824
DOI10.1016/0167-6377(91)90044-PzbMath0745.90052MaRDI QIDQ1180824
Publication date: 27 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90044-p
90C10: Integer programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Reducing the number of variables in integer quadratic programming problem, On dominated terms in the general knapsack problem, Unbounded knapsack problem: Dynamic programming revisited
Uses Software
Cites Work