ACM Home Page
Please provide us with feedback. Feedback
A computational study of a multiple-choice knapsack algorithm
Full text PdfPdf (919 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 9 ,  Issue 2  (June 1983) table of contents
Pages: 184 - 198  
Year of Publication: 1983
ISSN:0098-3500
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
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 58,   Citation Count: 5
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/357456.357458
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BALINTFY, J L, Ross, g. T., sINHA, P., AND ZOLTNERS, A. A. A mathematical programming system for preference-maximized nonselective menu planning and scheduling. Math. Program 15 (1978), 63-76.
 
2
BEALE, E.M.L., AND TOMLIN, J.A. An integer programming approach to class of combinatorial problems. Math. Program. 3 (1972), 339-344.
 
3
FISHER, M.L. The Lagrangian relaxation method for solving integer programming problems. Manage. Scl. 27, 1 (1981), 1-18.
 
4
GARFINKEL, R.S., AND NEMHAUSER, G.L. Integer Programming. Wiley, New York, 1972.
 
5
GEOFFRION, A.M. Langrangian relaxation for integer programming. Math. Program. Study. 2 (1974), 82-114.
 
6
GEOFFRION, A.M., AND MARSTEN, R.E. Integer programming algorithms A framework and state-of-the-art survey. Manage. Sci. 18, 7 (1972), 465-491.
 
7
GLOVER, F. Surrogate constraint duality in mathematical programming. Oper. Res. 23, 3 (1975), 434-451.
 
8
GLOVER, F., AND KLINGMAN, D A o(n log n) algorithm for LP knapsacks with GUB constraints. Math. Program. 17 (1979), 345-361.
 
9
KOLESAR, P. Assignment of optimal redundancy in systems subject to failure Operations Research Group Tech. Rep., Columbia Univ., New York, 1966.
 
10
KUNG, D.S. The Mulhple Choice Knapsack Problem: Algorithms and Apphcatmns. Ph.D (hssertation, Umv. of Texas, Austin, 1982.
 
11
LORtE, J., AND SAVAGE, L. Three problems in capital rationing. J. Bus. 38 (1955), 229-239.
 
12
SISHA, P., AND ZOLTNERS, A.A. The multiple-choice knapsack problem. Oper Res. 27, 3 (May/ June 1979), 503-515.
 
13
SINHA, P., AND ZOLTNERS, A.A. Integer programming models for sales resource allocation. Manage. Sc~. 26, 3 (1989), 242-260.
 
14
WEINGARTNER, H. Capital budgeting and interrelated projects: Survey and synthesis. Manage Sci. 12, 7 (1968), 485-516.


Collaborative Colleagues:
R. D. Armstrong: colleagues
D. S. Kung: colleagues
P. Sinha: colleagues
A. A. Zoltners: colleagues