A polynomial approximation scheme for the subset sum problem

DOI10.1016/0166-218X(94)00106-NzbMath0830.68067MaRDI QIDQ1346700

Horacio Hideki Yanasse, Peter John Harley, Alan Solon Ivor Zinober, Nei Yoshihiro Soma

Publication date: 10 April 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

heuristicpolynomial approximation scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical programming (90C99)

Related Items (1)

An exact algorithm for the subset sum problem

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• An introduction to parallelism in combinatorial optimization
• Worst-case analysis of an approximation scheme for the subset-sum problem
• Worst-case analysis of greedy algorithms for the subset-sum problem
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
• Discrete-Variable Extremum Problems

This page was built for publication: A polynomial approximation scheme for the subset sum problem