The growth of m-constraint random knapsacks

DOI10.1016/0377-2217(90)90303-SzbMath0708.90057OpenAlexW2024867790MaRDI QIDQ920844

Kenneth E. Schilling

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90303-s

zbMATH Keywords

asymptotic valuerandom knapsack

Mathematics Subject Classification ID

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

Related Items (10)

The growth of multi-constraint random knapsack with various right-hand sides of the constraints ⋮ An improved typology of cutting and packing problems ⋮ The growth of multi-constraint random knapsacks with large right-hand sides of the constraints ⋮ Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm ⋮ On the growth of random knapsacks ⋮ 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 ⋮ 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
• On the growth of random knapsacks

This page was built for publication: The growth of m-constraint random knapsacks