|
Itogi Nauki i Tekhniki. Seriya "Teoriya Veroyatnostei. Matematicheskaya Statistika. Teoreticheskaya Kibernetika", 1979, Volume 16, Pages 39–101
(Mi intv40)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Discrete extremal problems
V. K. Leont'ev
Abstract:
Precise and heuristic algorithms for solving various classes of discrete extremal problems are considered as are the relations between the class of discrete extremal problems and linear programming and are extremal problems from the point of view of the theory of polynomial completeness. A class of bottleneck optimization problems and stability in discrete extremal problems with a linear object function are also considered.
Citation:
V. K. Leont'ev, “Discrete extremal problems”, Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 16, VINITI, Moscow, 1979, 39–101; J. Soviet Math., 15:2 (1981), 101–139
Linking options:
https://www.mathnet.ru/eng/intv40 https://www.mathnet.ru/eng/intv/v16/p39
|
Statistics & downloads: |
Abstract page: | 948 | Full-text PDF : | 743 |
|