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

DOI10.1016/0377-2217(94)90164-3zbMath0806.90096OpenAlexW1965455241MaRDI QIDQ1328623

Krzysztof Szkatuła

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

heuristicsprobabilityasymptotic valuerandom knapsack problem

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ When two-constraint binary knapsack problem is equivalent to classical 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

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

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