scientific article; zbMATH DE number 3689144

MaRDI QIDQ3883902zbMATH OpenFDO

Authors Bernhard Korte, Rainer Schrader

Publication date 1980

zbMATH Keywords

approximate solutionscombinatorial optimizationknapsack problempolynomial approximation schemespolynomially bounded algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited in

(3)

• Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
• Approximation scheduling algorithms: a survey
• Approximation schemes for parallel machine scheduling with availability constraints

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 Q3883902)