Approximate Algorithms for the 0/1 Knapsack Problem

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Sartaj Sahni Department of Computer, Information and Control Sciences, University of Minnesota, 114 Main Engineering Building, Minneapolis, MN
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 22 Issue 1, Jan. 1975
Pages 115-124
ACM New York, NY, USA
table of contents doi>10.1145/321864.321873
Approximate Algorithms for the 0/1 Knapsack Problem Published by ACM 1975 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 25
· Downloads (12 Months): 232
· Downloads (cumulative): 2,506
· Citation Count: 49


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder