Article
Full entry |
PDF
(3.8 MB)
Feedback
PDF
(3.8 MB)
Feedback
Keywords:
operations research
operations research
Summary:
The paper is a contribution to the general theory of problems of discrete programming. Particularly, the difficulties of such problems are investigated by theoretical means.
References:
[1] Коробков В. К.: О некоторых целочисленных задачах линейного программирования. Проблемы кибернетики, том 14, Москва 1965. Zbl 1099.01519
[2] Balas E.: An Additive Algorithm for Solving Linear Programs with 0- 1 Variables. Opns. Res. 13, 517-549, 1965. DOI 10.1287/opre.13.4.517 | MR 0183535
[3] Bloch M., Morávek J.: Bounds of the number of threshold functions. Information Processing Machines, Praha 1967.
[4] Winder R. O.: Bounds of threshold gate readability. TRNS IEEE EC - 12, Oct. 63.
[5] Нечипорук E. И.: О синтезе схем из пороговых элементов. Проблемы кибернетики. том 11, Москва 1964. Zbl 1117.65300
[6] Goldman A. J., Tucker A. W.: Polyhedral Convex Cones, Linear Inequalities and Related Systems. Princeton 1956. MR 0087974
[7] Ford L. R., Fulkerson D. R.: Flows in Networks. Princeton 1962. MR 0159700 | Zbl 0106.34802
[8] Bellman R. E.: Dynamic Programming Treatment of the Travelling Salesman Problem. J. Assoc. for Соmр. Mach. 9, 61 - 63 (1962). MR 0135702 | Zbl 0106.14102
[9] Little J. D. C., Murty K. G., Sweeney D. W., and Karel C.: An Algorithm for the Travelling Salesman Problem. Opns. Res. 11, 972-989, 1963. DOI 10.1287/opre.11.6.972
[10] Vlach M.: Řešení dopravního problému metodou větvení. Ekonomicko-matematický obzor, 2, N. 4, 1966.
[11] Yajima S., Ibaraki T.: A lower Bound of the Number of Threshold Functions. IEEE, EC Dec. 1965, Vol. 14, N. 6. Zbl 0197.43606
[12] Morávek J.: О некоторых оценках для пороговых функций. Term paper, Leningrad University, 1963.
Search
Partner of
