scientific article; zbMATH DE number 1182767

MaRDI QIDQ4400850zbMATH OpenFDO

Authors Hans Kellerer, Ulrich Pferschy

Publication date 2 August 1998

zbMATH Keywords

0-1 knapsackfully polynomial approximation

Mathematics Subject Classification ID

Boolean programming (90C09) Dynamic programming (90C39)

Recommendations

• A new fully polynomial time approximation scheme for the Knapsack problem
• The fully polynomial approximation algorithm for the 0-1 knapsack problem
• A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint (extended abstract)
• A new approximation algorithm for the knapsack problem
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• scientific article; zbMATH DE number 1418266
• A new approximate algorithm for the knapsack problem
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• scientific article; zbMATH DE number 710573
• scientific article; zbMATH DE number 2059840

Cited in

(15)

• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• A new fully polynomial time approximation scheme for the Knapsack problem
• Improved dynamic programming in connection with an FPTAS for the knapsack problem
• Hybrid rounding techniques for knapsack problems
• A deterministic polynomial-time approximation scheme for counting knapsack solutions
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
• scientific article; zbMATH DE number 2059840 (Why is no real title available?)
• scientific article; zbMATH DE number 6861894 (Why is no real title available?)
• A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint (extended abstract)
• A new approximation algorithm for the knapsack problem
• A faster FPTAS for knapsack problem with cardinality constraint
• The fully polynomial approximation algorithm for the 0-1 knapsack problem
• Improved algorithms for two single machine scheduling problems
• On the machine scheduling problem with job delivery coordination
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications

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