This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. S. Mikhalevich and N. Z. Shor, “Numerical solution of multiple-choice problems by the method of sequential analysis of alternatives,” in: Scientific-Methodological Papers of the Seminar in Mathematical Economics [in Russian], No. 1, LEMM and Vychl. Tsentr Akad. Nauk SSSR, Moscow (1962), pp. 15–42.
V. S. Mikhalevich, “Sequential optimization algorithms and their application. I, II,” Kibernetika, No. 1, 45–56; No. 2, 85–88 (1965).
V. S. Mikhalevich and V. V. Shkurba, “Sequential optimization schemes in work scheduling problems,” Kibernetika, No. 2, 34–40 (1966).
V. S. Mikhalevich, Yu. M. Ermol'ev, V. V. Shkurba, and N. Z. Shor, “Complex systems and the solution of extremum problems,” Kibernetika, No. 5, 29–39 (1967).
V. S. Mikhalevich (editor), Computer Methods for Choosing Optimal Planning Solutions [in Russian], Naukova Dumka, Kiev (1977).
R. Bellman, Dynamic Programming, Princeton Univ. Press (1962).
A. F. Voloshin, “An algorithm for the solution of a zero-to-one linear programming problem,” in: Computational Mathematics in Modern Scientific and Technological Progress [in Russian], Inst. Kibern. Akad. Nauk SSSR, Kiev (1974), pp. 96–101.
A. F. Voloshin, “An optimization method for integer models,” in: Modeling and Optimization of Control Systems [in Russian], Vishcha Shkola, Kiev (1974), pp. 58–65.
V. L. Volkovich and A. F. Voloshin, “An algorithm for the solution of the discrete separable programming problem,” Issled. Oper. ASU, No. 9, 33–41 (1977).
V. L. Volkovich and A. F. Voloshin, “A schema of the method of sequential analysis and fathoming of alternatives,” Kibernetika, No. 4, 98–105 (1978).
V. L. Volkovich, A. F. Voloshin, and Yu. M. Pozdnyakov, Decomposition in Discrete Separable Programming Problems [in Russian], Preprint Inst. Kibern. Akad. Nauk UkrSSR, No. 79-18, Kiev (1979).
V. L. Volkovich and A. F. Voloshin, “A reliability maximizing algorithm under constraints,” Avtomatika, No. 5, 3–12 (1975).
I. V. Sergienko, V. L. Volkovich, V. A. Roshchin, A. F. Voloshin, et al., “On the results of a computer experiment solving zero-to-one integer linear programming problems,” Upr. Sist. Mash., No. 6, 66–69 (1979).
M. M. Kovalev, Discrete Optimization [in Russian], Beloruss. Gos. Univ., Minsk (1977).
I. V. Sergienko, “Development of a certain approach to the solution of discrete optimization systems in data processing systems and management control systems,” Upr. Sist. Mash., No. 6, 107–114 (1974).
E. Balas, “An additive algorithm for solving linear programs with zero-to-one variables,” Oper. Res.,13, No. 4, 517–546 (1965).
V. A. Emelichev and A. M. Kraverskii, “A computer experiment solving integer linear programming problems by the construction of sequential programs,” Zh. Vychisl. Mat. Mat. Fiz.,13, No. 12, 467–471 (1973).
V. A. Pir'yanovich, “Generators of test problems for integer linear programming,” Vestn. Belorus. Gos. Univ., Ser. 1, No. 1 (1978).
A. A. Korbut, I. Kh. Sigal, and Yu. Yu. Finkel'shtein, “The branch-and-bound method (a survey of theory, algorithm, programs, and applications),” Mat. Oper. Stat., Ser. Optim.,8, No. 2, 253–280 (1977).
A. I. Kuksa and N. Z. Shor, “A method of estimating the number of conditionally optimal trajectories in separable dynamic programming,” Kibernetika, No. 6, 18–87 (1972).
V. M. Ivanin, Estimating the Complexity of Some Discrete Programming Problems. Author's Abstract of Candidate's Dissertation, Kiev (1976).
Additional information
Translated from Kibernetika, No. 3, pp. 76–85, May–June, 1980.
Rights and permissions
About this article
Cite this article
Mikhalevich, V.S., Volkovich, V.L., Voloshin, A.F. et al. Algorithms for sequential analysis and fathoming in discrete optimization problems. Cybern Syst Anal 16, 389–399 (1980). https://doi.org/10.1007/BF01078258
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01078258