Skip to main content
SpringerLink
Log in

Discrete optimization. Sequential decision schemes. I

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. R. Bellman, Dynamic Programming, Princeton University Press, Princeton (1957).

    Google Scholar 

  2. R. Bellman and S. Dreyfus, Applied Dynamic Programming, Princeton University Press (1962).

  3. G. Dantzig, Linear Programming and Extensions, Princeton University Press (1963).

  4. A. A. Korbut and Yu. Yu. Finkel'shtein, Discrete Programming [in Russian], Nauka, Moscow (1969).

    Google Scholar 

  5. V. Ya. Burdyuk and V. V. Shkurba, “Scheduling theory. Problems and methods of solution. I,” Kibernetika, No. 1 (1971).

  6. V. N. Burkov and S. E. Lovetskii, “Methods of solving extremal problems of a combinatorial type (survey),” Izv. Akad. Nauk SSSR, Tekhnicheskaya Kibernetika, No. 4 (1968).

  7. V. N. Burkov and S. E. Lovetskii, “Methods of solving extremal problems of a combinatorial type (survey),” Avtomat. i Telemekhan.,29, No. 11 (1968).

  8. V. S. Vaksman and A. M. Gal'perin, “Modified Kelly method for solving descriptive piecewise-linear problems of convex programming,” in: Proceedings of the Third Winter School on Mathematical Programming and Related Questions [in Russian], Moscow (1970), Vol. 1.

  9. A. M. Gal'perin, “On one class of methods of discrete programming,” in: Proceedings of the First Winter School on Mathematical Programming [in Russian], Moscow (1969), Vol. 2.

  10. A. M. Gal'perin, “Two problems of optimal allocation of production,” Kibernetika, No. 3 (1971).

  11. V. A. Emelichev and V. I. Komlik, “Use of dynamic programming in solving allocation problems,” Dokl. Akad. Nauk BSSR,10, No. 10 (1966).

  12. V. A. Emelichev and V. I. Komlik, “Certain problems of allocation of production,” Dokl. Akad. Naul BSSR,12, No. 10 (1968).

  13. V. A. Emelichev and V. I. Komlik, “On reliability problems,” Izv. Akad. Nauk BSSR, Seriya Fiziko-Matematicheskikh Nauk, No. 5 (1968).

  14. V. A. Emelichev and V. I. Komlik, On one approach to solving discrete programming problems” in: Automated Systems of Enterprise Control [in Russian], IK AN UkrSSR, Kiev (1968), Vol. 1.

    Google Scholar 

  15. V. A. Emelichev, I. F. Klebanov, and V. I. Komlik, “Possibilities of using computers and the methods of mathematical programming for solving problems of allocation of production,” in: Materials of the Interregional Seminar of the OON on Allocation of Industry and Regional Development,” Izdatel'stvo. OON, Minsk (1968).

    Google Scholar 

  16. V. A. Emelichev, “Convex programming with separable objective functions with linear constraints,” Izv. Akad. Nauk BSSR, Seriya Fiziko-Matematicheskikh Nauk, No. 6 (1969).

  17. V. A. Emelichev and V. I. Komlik, “The solution of discrete programming problems by the construction of a sequence of schemes,” Dokl. Akad. Nauk SSSR,188, No. 2 (1969).

  18. V. A. Emelichev (Emeličev) and V. I. Komlik, “The solution of discrete programming problems by the construction of a sequence of schemes,” [in English], Soviet Math. Dokl.,10, No. 5 (1969).

  19. V. A. Emelichev, V. I. Komlik, et al., “On allocation problems,” in: Proceedings of the Second Republican Conference of Belorussian Mathematicians [in Russian], Izdatel'stvo BGU, Minsk (1969).

    Google Scholar 

  20. V. A. Emelichev, “Problems of discrete optimization,” Dokl. Akad. Nauk SSSR,192, No. 5 (1970).

  21. V. A. Emelichev, V. I. Komlik, and I. M. Kraverskii, “Algorithm for solving problems of integer linear programming by a special form of the method of constructing sequences of plans,” Dokl. Akad, Nauk BSSR,14, No. 11 (1970).

  22. V.A. Emelichev and V. I. Komlik, “On multiproduct allocation problems,” Vestnik BGU, Seriya I, No. 1 (1970).

  23. V. A. Emelichev and M.M. Kovalev, “Solving certain problems of concave programming by the method of constructing sequences of plans. I,” Izv. Akad. Nauk BSSR, Seriya Fiziko-Matematicheskikh, Nauk, No. 6 (1970).

  24. V. A. Emelichev and M. M. Kovalev, “Solving certain problems of concave programming by the method of constructing sequences of plans. II,” Izv. Akad. Nauk BSSR, Seriya Fiziko-Matematicheskikh Nauk, No. 6 (1971).

  25. V. A. Emelichev, “The theory of discrete optimization,” Dokl. Akad. Nauk SSSR,198, No. 2 (1971).

  26. V. A. Emelichev, M. M. Kovalev, and A. M. Kononenko, “Two approximative methods of solving problems of integer linear programming with Boolean variables,” in: Automated Control Systems [in Russian], TsNIITU, Minsk (1971), Vol. 5.

    Google Scholar 

  27. V. A. Komlik and V. A. Emelichev, “Solving integer programming problems with 0–1 variables,” Dokl. Akad. Nauk BSSR,11, No. 12 (1967).

  28. V. I. Komlik, “On one multiproduct allocation problem,” Izv. Akad. Nauk BSSR, Seriya Fiziko-Matematicheskikh Nauk, No. 4 (1967).

  29. V. I. Komlik, “Methods of solving certain combinatorial extremal problems,” Abstract of Dissertation [in Russian], Akad. Nauk BSSR (1968).

  30. V. I. Komlik and V. A. Emelichev, “On one problem of integer programming,” Izv. Akad. Nauk BSSR, Seriya Fiziko-Matematicheskikh Nauk, No. 4 (1968).

  31. Abstracts of Papers at the Conference on Mathematical Optimal Programmings [in Russian], Novosibirsk (1965).

  32. G. Little, K. Murti, et al., “Algorithm for solving the traveling salesman problem,” Ékonomika i Matematicheskie Metody,1, No. 1 (1965).

  33. V. S. Mikhalevich, Sequential optimization algorithms and their application. I, II,” Kibernetika, Nos. 1, 2 (1965).

  34. V. S. Mikhalevich and V. V. Shkurba, “Sequential schemes of optimization in problems of ordered performance of operations,” Kibernetika, No. 2 (1966).

  35. I. I. Pyatetskii-Shapiro, V. A. Volkonskii, et al., “One iterative method of solving integer programming problems,” Dokl. Akad. Nauk SSSR,169, No. 6 (1966).

  36. I. V. Romanovskii, “Methods of implicit scan for solving integer programming problems with bivalent variables,” Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, No. 4 (1970).

  37. N. Z. Shor, “On the structure of algorithms for the numerical solution of problems of optimal planning and design,” Abstract of Dissertation [in Russian], Kiev (1964).

  38. E. Balas, “An additive algorithm for solving linear programs with zero-one variables,” Operations Research,13, No. 4 (1965).

  39. E. Balas, “A note on the branch-and-bound principle,” Operations Research,16, No. 2 (1968).

  40. J. E. Falk and R. M. Soland, “An algorithm for separable non-convex prgramming problems,” Management Sciences,15, No. 9 (1969).

  41. R. E. Gomory, “Outline of an algorithm for integer solution to linear programs,” Bull. Amer. Math. Soc.,64, No. 5 (1958).

  42. A. H. Land and A. G. Doig, “An automatic method of solving discrete programming problems,” Econimetrica,28, No. 3 (1960).

Download references

Authors
  1. V. A. Emelichev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 109–121, November–December, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Emelichev, V.A. Discrete optimization. Sequential decision schemes. I. Cybern Syst Anal 7, 1067–1081 (1971). https://doi.org/10.1007/BF01068838

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068838

Keywords

Search

Navigation