A Fast Approximation Algorithm for the Subset-sum Problem

DOI10.1111/1475-3995.00366zbMath1022.90009OpenAlexW2154335216MaRDI QIDQ3148101

Bartosz Przydatek

Publication date: 3 November 2003

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

Full work available at URL: https://doi.org/10.1111/1475-3995.00366

zbMATH Keywords

approximation algorithmlocal searchrandomized algorithmsubset-sum problem

Mathematics Subject Classification ID

Integer programming (90C10) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Investigating volatility transmission across international equity markets using multivariate fractional models ⋮ Techniques for solving subset sum problems within a given tolerance

This page was built for publication: A Fast Approximation Algorithm for the Subset-sum Problem