Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Vesley, Reading, Mass. 1974.
R.D. Armstrong, D.S. Kung, P. Sinha and A.A. Zoltners, "A Computational Study of a Multiple Choice Knapsack Algorithm", ACM Trans. on Math. Software 2 (1983), 184–198.
M.E. Dyer, "An 0(n) Algorithm for the Multiple Choice Knapsack Linear Program", Research Report, Tesside Polytechnic (1982).
G.N. Frederickson and D.B. Johnson, "The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns", J. Comput. and System. Sci. 24, 197–208 (1982).
F. Glover and D. Klingman, "An 0(n log n) Algorithm for LP Knapsack with GUB Constraints", Math. Programmnig 17, 345–361, (1979).
P. Sinha and A.A. Zoltners, "The Multiple Choice Knaspsack Problem", Opus. Res. 27, 503–515 (1979).
E. Zemel, "The Linear Multiple Choice Knapsack Problem", Opns. Res. 28, 1412–1423 (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Dudziński, K., Walukiewicz, S. (1984). An algorithm for Multiple Choice Knapsack Problem. In: Thoft-Christensen, P. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008889
Download citation
DOI: https://doi.org/10.1007/BFb0008889
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13185-4
Online ISBN: 978-3-540-38828-9
eBook Packages: Springer Book Archive