On the growth of random knapsacks

DOI10.1016/0166-218X(90)90004-VzbMath0703.90065OpenAlexW2085163815MaRDI QIDQ916565

John W. Mamer, Kenneth E. Schilling

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90004-v

zbMATH Keywords

asymptotic value of the optimal knapsackrandom knapsacks

Mathematics Subject Classification ID

Linear programming (90C05) Stochastic programming (90C15) Boolean programming (90C09)

Related Items (7)

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 growth of m-constraint random knapsacks ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Random sequencing jobs with deadlines problem: Growth of the optimal solution values ⋮ Random knapsacks with many constraints ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

Cites Work

• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• The growth of m-constraint random knapsacks
• Unnamed Item

This page was built for publication: On the growth of random knapsacks