A computational study of a multiple-choice knapsack algorithm

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: R. D. Armstrong Department of Quantitative Business Analysis, University of Georgia, Athens, GA
D. S. Kung Department of Management Science, California State University, Los Angeles, CA
P. Sinha Graduate School of Management, Rutgers University, Newark, NJ
A. A. Zoltners Department of Marketing, Northwestern University, Evanston, IL
A computational study of a multiple-choice knapsack algorithm Published by ACM 1983 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 50
· Downloads (cumulative): 849
· Citation Count: 10

Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 9 Issue 2, June 1983
Pages 184-198
ACM New York, NY, USA
table of contents doi>10.1145/357456.357458

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