The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
From MaRDI portal
Publication:1371952
DOI10.1016/S0167-6377(97)00024-2zbMath0885.90084OpenAlexW2157999593MaRDI QIDQ1371952
Publication date: 22 April 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00024-2
asymptotic value\(m\)-constraint, \(n\)-variable, binary random knapsackworst case and probabilistic analysis
Related Items (4)
The multidimensional 0-1 knapsack problem: an overview. ⋮ 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
- Unnamed Item
- 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
- Random knapsacks with many constraints
- The growth of multi-constraint random knapsack with various right-hand sides of the constraints
This page was built for publication: The growth of multi-constraint random knapsacks with large right-hand sides of the constraints
