scientific article; zbMATH DE number 3784631

MaRDI QIDQ3962773zbMATH OpenFDO

Authors

Publication date 1982

zbMATH Keywords

greedy algorithmalmost sure convergenceapproximate solutionerror estimationexact solutionprobabilistic analysisnumerical studydata preprocessingcomparison of greedy heuristicscompletely random inputrandom 0-1 knapsack problem

Mathematics Subject Classification ID

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

Cited in

(3)

• Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
• The matroidal knapsack: A class of (often) well-solvable problems
• A probabilistic analysis of the multiknapsack value function

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