Abstract
We consider some classes of network minimax problems that generalize combinatorial versions of shortest and longest path problems in networks. Effective polynomial-time algorithms are proposed for solving these problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
V. S. Mikhalevich, V. A. Trubin, and N. Z. Shor, Optimization Problems in Production-Transportation Planning [in Russian], Nauka, Moscow (1986).
V. A. Gurvich, A. V. Karzanov, and L. G. Khachiyan, “Cyclic games and finding minimax mean cycles in directed graphs,” Zh. Vychisl. Matem. Mat. Fiz.,28, No. 9, 1407–1417 (1988).
E. Minieka, Optimization Algorithms for Networks and Graphs, M. Dekker, New York (1978).
G. Gallo and S. Pallottino, “Shortest path algorithms,” Ann. Oper. Res.,13, No. 1-4, 3–79 (1988).
L. G. Khachiyan, “On exact solution of systems of linear inequalities and linear programming problems,” Zh. Vychisl. Mat. Mat. Fiz.,22, No. 6, 999–1002 (1982).
R. A. Howard, Dynamic Programming and Markov Processes [Russian translation], Sovestkoe Radio, Moscow (1964).
V. V. Fedorov, Numerical Maximin Methods [in Russian], Nauka, Moscow (1979).
Additional information
Translated from Kibernetika, No. 1, pp. 70–75, January–February, 1991.
Rights and permissions
About this article
Cite this article
Lozovanu, D.D. Algorithms to solve some classes of network minimax problems and their applications. Cybern Syst Anal 27, 93–100 (1991). https://doi.org/10.1007/BF01068651
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068651