scientific article; zbMATH DE number 3904330

MaRDI QIDQ3682239zbMATH OpenFDO

Authors N. Schröter

Publication date 1984

zbMATH Keywords

greedy algorithmaverage-case analysisrandom coefficientsexpected errorbinary knapsack problemfinite upper boundsSahni's polynomial time approximation scheme

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3878679
• scientific article; zbMATH DE number 4057284
• Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
• The average behaviour of greedy algorithms for the knapsack problem: general distributions
• The primal and dual greedy algorithms for the knapsack problem: the average behavior

Cited in

(8)

• Greedy algorithms for the minimization knapsack problem: average behavior
• scientific article; zbMATH DE number 3878679 (Why is no real title available?)
• Average saving effects in enumerative methods for solving knapsack problems
• Probabilistic analysis of knapsack core algorithms
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• Average behavior of greedy algorithms for the minimization knapsack problem: General coefficient distributions
• scientific article; zbMATH DE number 910873 (Why is no real title available?)
• The average behaviour of greedy algorithms for the knapsack problem: general distributions

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