The growth of multi-constraint random knapsack with various right-hand sides of the constraints

DOI10.1016/0377-2217(94)90164-3MaRDI QIDQ1328623zbMATH OpenOpenAlexFDO

Authors Krzysztof Szkatula

Publication date 26 July 1994

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(94)90164-3

zbMATH Keywords

asymptotic valueheuristicsprobabilityrandom knapsack problem

Mathematics Subject Classification ID

Boolean programming (90C09) Stochastic programming (90C15) Combinatorial optimization (90C27)

Recommendations

• The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
• The growth of m-constraint random knapsacks
• Random knapsacks with many constraints
• On the growth of random knapsacks
• A probabilistic analysis of the multiknapsack value function

Cites work

• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• scientific article; zbMATH DE number 4167855 (Why is no real title available?)
• scientific article; zbMATH DE number 4057284 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the growth of random knapsacks
• The growth of m-constraint random knapsacks

Cited in

(10)

• On rates of convergence and asymptotic normality in the multiknapsack problem
• The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem
• Random sequencing jobs with deadlines problem: Growth of the optimal solution values
• The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
• The multidimensional 0-1 knapsack problem: an overview.
• When two-constraint binary knapsack problem is equivalent to classical knapsack problem?
• The two-constraint binary knapsack problem's average case analysis for constraints with small, moderate and large coefficients
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• On the growth of random knapsacks
• The growth of m-constraint random knapsacks

This page was built for publication: The growth of multi-constraint random knapsack with various right-hand sides of the constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328623)