scientific article
From MaRDI portal
Publication:3888846
zbMath0444.90074MaRDI QIDQ3888846
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityknapsack problembottleneck problempartition problemepsilon-approximation algorithmtight boundsrange-and-bound methodarborescent knapsackdevide-and-conquer type methodsfixed- charge knapsack problemfully polynomial algorithms
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)
Related Items (7)
On the complexity and approximation of the maximum expected value all-or-nothing subset ⋮ An efficient fully polynomial approximation scheme for the Subset-Sum problem. ⋮ Fast approximation algorithm for job sequencing with deadlines ⋮ Worst-case analysis of greedy algorithms for the subset-sum problem ⋮ A new linear storage, polynomial-time approximation scheme for the subset-sum problem ⋮ Approximation algorithms for knapsack problems with cardinality constraints ⋮ Approximation schemes for the subset-sum problem: Survey and experimental analysis
This page was built for publication: