Random knapsacks with many constraints

DOI10.1016/0166-218X(92)00125-6zbMath0791.90038OpenAlexW2039258038MaRDI QIDQ1315463

Kenneth E. 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

rate of growthasymptotic valuesrandom knapsack problem

Mathematics Subject Classification ID

Stochastic programming (90C15)

Related Items (6)

An adaptive stochastic knapsack problem ⋮ The growth of multi-constraint random knapsacks with large right-hand sides of the constraints ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ 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 multidimensional 0-1 knapsack problem -- bounds and computational aspects

Cites Work

• Unnamed Item
• On the growth of random knapsacks
• The growth of m-constraint random knapsacks
• Probability Inequalities for Sums of Bounded Random Variables

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