scientific article; zbMATH DE number 3694944

MaRDI QIDQ3888846zbMATH OpenFDO

Authors G. V. Gens, Eugene Levner

Publication date 1980

zbMATH Keywords

arborescent knapsackbottleneck problemcomputational complexitydevide-and-conquer type methodsepsilon-approximation algorithmfixed- charge knapsack problemfully polynomial algorithmsknapsack problempartition problemrange-and-bound methodtight bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited in

(7)

• Approximation schemes for the subset-sum problem: Survey and experimental analysis
• Fast approximation algorithm for job sequencing with deadlines
• An efficient fully polynomial approximation scheme for the Subset-Sum problem.
• Approximation algorithms for knapsack problems with cardinality constraints
• A new linear storage, polynomial-time approximation scheme for the subset-sum problem
• On the complexity and approximation of the maximum expected value all-or-nothing subset
• Worst-case analysis of greedy algorithms for the subset-sum problem

This page was built for publication:

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