Abstract
Some known results about lower and upper bounds for the number of distinct solutions to a discrete knapsack problem are given. In this paper some sharper bounds are proved by using geometrical methods. The proof of the upper bound is based on the famous (and deep) Brunn-Minkowski inequality. and It is a new and interesting application method of geometrical arguments in discrete programming.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
