scientific article; zbMATH DE number 3878679

MaRDI QIDQ3343773zbMATH OpenFDO

Authors Krzysztof Szkatula, Marek Libura

Publication date 1983

zbMATH Keywords

greedy algorithmmean valuecomparison of algorithmsbinary knapsack problemprobabilistic behaviour

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 4057284
• scientific article; zbMATH DE number 3904330
• The primal and dual greedy algorithms for the knapsack problem: the average behavior
• scientific article; zbMATH DE number 1264402
• A class of generalized greedy algorithms for the multi-knapsack problem

Cited in

(9)

• Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
• The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
• scientific article; zbMATH DE number 3904330 (Why is no real title available?)
• scientific article; zbMATH DE number 4057284 (Why is no real title available?)
• Probabilistic analysis of a bin covering algorithm
• Average saving effects in enumerative methods for solving knapsack problems
• Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
• Expectation analysis for bounding solutions of the 0-1 knapsack problem
• Average-case performance of rollout algorithms for knapsack problems

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