Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning

DOI10.1287/OPRE.21.1.332MaRDI QIDQ5684502zbMATH OpenOpenAlexFDO

Authors Bruce Faaland

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(7)

• A new enumeration scheme for the knapsack 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
• An efficient pruning algorithm for value independent knapsack problem using a DAG structure
• Two linear approximation algorithms for the subset-sum problem
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• Preprocessing to reduce vehicle capacity for routing problems

This page was built for publication: Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5684502)