The growth of multi-constraint random knapsacks with large right-hand sides of the constraints

DOI10.1016/S0167-6377(97)00024-2zbMATH Open0885.90084OpenAlexW2157999593MaRDI QIDQ1371952FDOQ1371952

Authors: Krzysztof Szkatula 

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

Recommendations

• The growth of multi-constraint random knapsack with various right-hand sides of the constraints
• Random knapsacks with many constraints
• The growth of m-constraint random knapsacks
• On the growth of random knapsacks

zbMATH Keywords

asymptotic value\(m\)-constraint, \(n\)-variable, binary random knapsackworst case and probabilistic analysis

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
• Random knapsacks with many constraints
• The growth of multi-constraint random knapsack with various right-hand sides of the constraints
• On the growth of random knapsacks
• The growth of m-constraint random knapsacks

Cited In (8)

• The growth of multi-constraint random knapsack with various right-hand sides of the constraints
• Random sequencing jobs with deadlines problem: Growth of the optimal solution values
• The multidimensional 0-1 knapsack problem: an overview.
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• When two-constraint binary knapsack problem is equivalent to classical knapsack problem?
• A probabilistic analysis of the multiknapsack value function
• On the growth of random knapsacks
• The growth of m-constraint random knapsacks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1371952)