Geodesic
On the complexity of discrete programming problems
Applications of Mathematics, Tome 14 (1969) no. 6, pp. 442-474

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

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.
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.
DOI : 10.21136/AM.1969.103254
Classification : 90-56
Keywords: operations research 
Morávek, Jaroslav. On the complexity of discrete programming problems. Applications of Mathematics, Tome 14 (1969) no. 6, pp. 442-474. doi: 10.21136/AM.1969.103254
@article{10_21136_AM_1969_103254,
     author = {Mor\'avek, Jaroslav},
     title = {On the complexity of discrete programming problems},
     journal = {Applications of Mathematics},
     pages = {442--474},
     year = {1969},
     volume = {14},
     number = {6},
     doi = {10.21136/AM.1969.103254},
     mrnumber = {0253745},
     zbl = {0196.22804},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1969.103254/}
}
TY  - JOUR
AU  - Morávek, Jaroslav
TI  - On the complexity of discrete programming problems
JO  - Applications of Mathematics
PY  - 1969
SP  - 442
EP  - 474
VL  - 14
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1969.103254/
DO  - 10.21136/AM.1969.103254
LA  - en
ID  - 10_21136_AM_1969_103254
ER  - 
%0 Journal Article
%A Morávek, Jaroslav
%T On the complexity of discrete programming problems
%J Applications of Mathematics
%D 1969
%P 442-474
%V 14
%N 6
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1969.103254/
%R 10.21136/AM.1969.103254
%G en
%F 10_21136_AM_1969_103254

[1] Коробков В. К.: О некоторых целочисленных задачах линейного программирования. Проблемы кибернетики, том 14, Москва 1965. | Zbl

[2] Balas E.: An Additive Algorithm for Solving Linear Programs with 0- 1 Variables. Opns. Res. 13, 517-549, 1965. | DOI | MR

[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

[6] Goldman A. J., Tucker A. W.: Polyhedral Convex Cones, Linear Inequalities and Related Systems. Princeton 1956. | MR

[7] Ford L. R., Fulkerson D. R.: Flows in Networks. Princeton 1962. | MR | Zbl

[8] Bellman R. E.: Dynamic Programming Treatment of the Travelling Salesman Problem. J. Assoc. for Соmр. Mach. 9, 61 - 63 (1962). | MR | Zbl

[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] 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

[12] Morávek J.: О некоторых оценках для пороговых функций. Term paper, Leningrad University, 1963.

Cité par Sources :