Random knapsacks with many constraints

DOI10.1016/0166-218X(92)00125-6MaRDI QIDQ1315463zbMATH OpenOpenAlexFDO

Authors K. Schilling

Publication date 10 March 1994

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(92)00125-6

zbMATH Keywords

asymptotic valuesrandom knapsack problemrate of growth

Mathematics Subject Classification ID

Stochastic programming (90C15)

Recommendations

• Knapsack problem with probability constraints
• Random knapsack in expected polynomial time
• Random knapsack in expected polynomial time
• Binary knapsack problems with random budgets
• scientific article; zbMATH DE number 1114460
• Algorithms – ESA 2004
• An experimental study of random knapsack problems
• The growth of m-constraint random knapsacks
• The stochastic knapsack problem

Cites work

• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• On the growth of random knapsacks
• Probability Inequalities for Sums of Bounded Random Variables
• The growth of m-constraint random knapsacks

Cited in

(16)

• 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 knapsack with various right-hand sides of the constraints
• 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?
• An adaptive stochastic knapsack problem
• A statistical analysis of the knapsack problem
• Statistical mechanics of the multi-constraint continuous knapsack problem
• Random knapsack in expected polynomial time
• 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
• A PTAS for the chance-constrained knapsack problem with random item sizes

This page was built for publication: Random knapsacks with many constraints

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