References
I. V. Sergienko and M. F. Kaspshitskaya, Models and Methods of Computer-Aided Solution of Combinatorial Problems of Optimization [in Russian], Naukova-Dumka, Kiev (1981).
H. Papadimitriu and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity [Russian translation], Mir, Moskow (1985).
V. Ya. Burdyuk, “Problem of elections as an approximation problem,” in: Intern. Conf. on Approximation Theory and Problems of Computing Mathematics, DDU, Dnipropetrovsk (1993), p. 32.
V. Ya. Burdyuk, Distances, DDU, Dnipropetrovs’k (1993).
E. G. Gol’shtein and D. B. Yudin, Transport-type Linear Programming Problems [in Russian], Nauka, Moscow (1969).
E. A. Dinits, “On solution of two assignment problems,” in: Research on Discrete Optimization [in Russian], Nauka, Moscow (1976), pp. 333–348.
Additional information
The study was supported by the Soros fund, grant No. APU051024.
Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 175–178, March–April, 1999.
Rights and permissions
About this article
Cite this article
Burdyuk, V.Y., Semenov, V.A. Solvable cases of a new combinatorial problem of optimization. Cybern Syst Anal 35, 332–334 (1999). https://doi.org/10.1007/BF02733482
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02733482