Techniques for solving subset sum problems within a given tolerance

DOI10.1111/J.1475-3995.2005.00517.XMaRDI QIDQ3410169zbMATH OpenOpenAlexFDO

Authors Ross J. W. James, Robert H. Storer

Publication date 22 November 2006

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2005.00517.x

zbMATH Keywords

branch-and-boundenumerationheuristicssubset sum

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Fast Approximation Algorithm For The Subset-Sum Problem
• A new linear storage, polynomial-time approximation scheme for the subset-sum problem
• Two linear approximation algorithms for the subset-sum problem
• A polynomial approximation scheme for the subset sum problem
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.

Cites work

• A Fast Approximation Algorithm for the Subset-sum Problem
• Core problems in knapsack algorithms
• D. Ray Fulkerson's Contributions to Operations Research
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(3)

• Solving dense subset-sum problems by using analytical number theory
• Optimal setup of a multihead weighing machine
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem

This page was built for publication: Techniques for solving subset sum problems within a given tolerance

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