Abstract
We analyse the multi-constraint zero-one knapsack problem, under the assumption that all coefficients are drawn from a uniform [0, 1] distribution and there are m = 0(1) constraints as the number of variables grows. We show that results on the single-constraint problem can be extended to this situation. Chiefly, we generalise a result of Lueker on the duality gap, and a result of Goldberg/Marchetti-Spaccamela on exact solvability. In the latter case, our methods differ markedly from those for the single-constraint result.
Sign-in/Register to access full text options 
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.
