Abstract
A generalization of the classical knapsack problem in which the effect of the selected items depends on the interactions between the items and may be arbitrary is considered. The mathematical model, the optimization algorithm, and the corresponding software are developed. The suggested approach is illustrated by a numerical example.
Similar content being viewed by others
References
Adams, A., Bloomfield, D., Booth, Ph., and England, P., Investment Mathematics and Statistics London: Graham and Trotman, 1993.
Braudly, R.A., Introductory Combinatorics New Jersey: Prentice Hall, 1999.
Gilmore, P.C. and Gomory, R.E., The theory of computation of Knapsack functions, J. ORSA, 1965, vol. 14, pp. 1045–1974.
Hu, T.C., Integer Programming and Network Flows Reading, MA: Addison-Wesley, 1970.
Rebezova, M., Sulima, N., and Surinov, R., Developing trends of air passenger transport services and service distribution channels, Transport and Telecommunication, 2012, vol. 13, pp. 159–166.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © M.I. Rebezova, N.I. Sulima, R.T. Surinov, 2013, published in Avtomatika i Vychislitel’naya Tekhnika, 2013, No. 2, pp. 70–76.
About this article
Cite this article
Rebezova, M.I., Sulima, N.I. & Surinov, R.T. A modification of the knapsack problem taking into account the effect of the interaction between the items. Aut. Control Comp. Sci. 47, 107–112 (2013). https://doi.org/10.3103/S0146411613020053
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411613020053