Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
From MaRDI portal
Publication:5684502
DOI10.1287/opre.21.1.332zbMath0267.90068OpenAlexW2054174464MaRDI QIDQ5684502
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.1.332
Related Items
An efficient pruning algorithm for value independent knapsack problem using a DAG structure, A new enumeration scheme for the knapsack problem, Preprocessing to reduce vehicle capacity for routing problems, Two linear approximation algorithms for the subset-sum problem, An upper bound for the zero-one knapsack problem and a branch and bound algorithm, Solving dense subset-sum problems by using analytical number theory, Faster Pseudopolynomial Time Algorithms for Subset Sum
