Techniques for solving subset sum problems within a given tolerance

DOI10.1111/j.1475-3995.2005.00517.xzbMath1114.90443OpenAlexW2145973893MaRDI QIDQ3410169

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

heuristicsbranch-and-boundenumerationsubset 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)

Related Items (1)

Optimal setup of a multihead weighing machine

Cites Work

• Unnamed Item
• Core Problems in Knapsack Algorithms
• A Fast Approximation Algorithm for the Subset-sum Problem
• D. Ray Fulkerson's Contributions to Operations Research

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