Skip to main content
Springer Nature Link
Log in

Solving the mixed-integer knapsack problem by decrease of dimension and use of dynamic programming

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

An Erratum to this article was published on 01 January 2016

Abstract

A method for finding an optimal solution of mixed-integer programming problems with one constraint is proposed. Initially, this method lessens the number of variables and the interval of their change; then, for the resulting problem one derives recurrent relations of dynamic programming that are used for computing. Using a matrix for information storage, we can solve problems of a suffi-ciently large dimension. The computational experiments demonstrate that the method in question is highly efficient.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gary, M. and Johnson, D., Computers and Intractability, San Francisco: Freeman, 1979; Moscow Mir, 1982.

    Google Scholar 

  2. Mashchenko, S.O., Decomposition algorithm of solution of linear programming partially integer-valued prob-lems, in Issledovanie zadach mnogokriterial’noi optimizatsii, sb., (Study of Problems of Multicriterial Optimiza-tion. Coll. Papers), Kiev Inst. Kibern. Akad. Nauk Ukr. SSR, 1984, pp. 49–63.

    Google Scholar 

  3. Roshchin, V.A., Semenova, N.V., and Sergienko, I.V., Questions of solution of problems of partially integer-val-ued programming of special type, in Teoriya optimal’nogo resheniya, sb. (Theory of Optimal Solution. Coll. Papers), Kiev, 1982, pp. 20–28.

    Google Scholar 

  4. Roshchin, V.A., Sergienko, I.V., and Semenova, N.V., On solution of partially integer-valued optimizing prob-lems, convex to continuous variables, Kibernetika, 1981, no. 5, pp. 62–66.

    MathSciNet  Google Scholar 

  5. Achterberg, T., Conflict analysis in mixed integer rogramming, Discr. Optim., 2007, vol. 4, pp. 4–20.

    Article  MathSciNet  MATH  Google Scholar 

  6. Bertacco, L., Fischetti, M., and Lodi, A., A feasibility pump heuristic for general mixed-integer problems, Discr. Optim., 2007, vol. 4, pp. 63–76.

    Article  MathSciNet  MATH  Google Scholar 

  7. Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., and Wunderling, R., Mixed-integer programming: A progress report, in The Sharpest Cut: The Impact of Manfred Padberg and his Work (M. Grotschel, ed.), MPS-SIAM Series on Optimization, 2004, pp. 309–325.

    Chapter  Google Scholar 

  8. Babaev, J.A., Veliev, G.P., Mamedov, K.Sh., and Yusifov, M.M., Solutions of two types of problem about knap-sack, Izvestiya Akad. Nauk SSSR, Tekh. Kiber., 1989, no. 3, pp. 29–36.

    Google Scholar 

  9. Mammadov, K.K., Computational aspects of the method of bilateral narrowing of the boundaries of the opti-mum and the variables in the mixed-integer knapsack problem, Proc. 4th Int. Conf. “Problems of Cybernetics and Informatics”, Baku, 2012, vol. III, pp. 122–124.

    Google Scholar 

  10. Mamedov, K.K., Determination of the smaller area, containing optimal solution for partially-integer knapsack problem, Doklady Nat. Akad. Nauk Azerbaidzhana, 2009, no. 3, pp. 30–37.

    Google Scholar 

  11. Maksimov, K.B. and Mamedov, K.K., Mixed-integer knapsack problem solving method using the narrow inter-vals for the criterion function and variables, Automat. Cont. Compt. Sci., 2010, vol. 44, pp. 216–226.

    Article  Google Scholar 

  12. Babaev, J.A., Mamedov, K.Sh., and Mekhtiev, M.G., Methods of construction of suboptimal solutions of multi-dimensional knapsack problem, Zh. Vych. Mat. Mat. Fiz., 1978, vol. 28, pp. 1443–1453.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Control Systems, National Academy of Sciences of Azerbaijan, ul. B. Vagabzade 9, Baku, AZ-1141, Azerbaijan

    K. Sh. Mamedov, K. K. Mamedov & S. K. Elchueva

Authors
  1. K. Sh. Mamedov
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. K. K. Mamedov
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. S. K. Elchueva
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to K. Sh. Mamedov.

Additional information

Original Russian Text © K.Sh. Mamedov, K.K. Mamedov, S.K. Elchueva, 2015, published in Avtomatika i Vychislitel’naya Tekhnika, 2015, No. 4, pp. 58–66.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mamedov, K.S., Mamedov, K.K. & Elchueva, S.K. Solving the mixed-integer knapsack problem by decrease of dimension and use of dynamic programming. Aut. Control Comp. Sci. 49, 231–238 (2015). https://doi.org/10.3103/S0146411615040082

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411615040082

Keywords