Approximation schemes for the subset-sum problem: Survey and experimental analysis

DOI10.1016/0377-2217(85)90115-8zbMATH Open0583.90070OpenAlexW2012468431MaRDI QIDQ1069445FDOQ1069445

Paolo Toth, Silvano Martello

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90115-8

zbMATH Keywords

heuristicscomputational experimentssubset-sum problempolynomial approximation schemes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for combinatorial problems
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• Hard Knapsack Problems
• Worst-case analysis of greedy algorithms for the subset-sum problem
• Probabilistic analysis of the subset-sum problem

Cited In (10)

• LATIN 2004: Theoretical Informatics
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
• Worst-case analysis of an approximation scheme for the subset-sum problem
• Heuristic methods and applications: A categorized survey
• Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
• A Fast Approximation Algorithm For The Subset-Sum Problem
• Minimizing makespan subject to minimum flowtime on two identical parallel machines
• A new linear storage, polynomial-time approximation scheme for the subset-sum problem
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Approximability of the Subset Sum Reconfiguration Problem

This page was built for publication: Approximation schemes for the subset-sum problem: Survey and experimental analysis

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