Abstract
The ratios of the values of objective functions for optimal solutions of linear and integer knapsack problems are considered. Estimates for these ratios are obtained. One-dimensional and multi-dimensional knapsack problems with Boolean variables are studied experimentally. For these problems, a hypothesis is formulated on the asymptotic behavior of the ratio as the number of variables grows.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Computer and Systems Sciences International
Paper Title
Journal
Date
