On the complexity of discrete programming problems

Jaroslav Morávek

Aplikace matematiky (1969)

  • Volume: 14, Issue: 6, page 442-474
  • ISSN: 0862-7940

Abstract

top
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.

How to cite

top

Morávek, Jaroslav. "On the complexity of discrete programming problems." Aplikace matematiky 14.6 (1969): 442-474. <http://eudml.org/doc/14619>.

@article{Morávek1969,
abstract = {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.},
author = {Morávek, Jaroslav},
journal = {Aplikace matematiky},
keywords = {operations research},
language = {eng},
number = {6},
pages = {442-474},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On the complexity of discrete programming problems},
url = {http://eudml.org/doc/14619},
volume = {14},
year = {1969},
}

TY - JOUR
AU - Morávek, Jaroslav
TI - On the complexity of discrete programming problems
JO - Aplikace matematiky
PY - 1969
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 14
IS - 6
SP - 442
EP - 474
AB - 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.
LA - eng
KW - operations research
UR - http://eudml.org/doc/14619
ER -

References

top
  1. Коробков В. К., О некоторых целочисленных задачах линейного программирования, Проблемы кибернетики, том 14, Москва 1965. (1965) Zbl1099.01519
  2. Balas E., 10.1287/opre.13.4.517, Opns. Res. 13, 517-549, 1965. (1965) MR0183535DOI10.1287/opre.13.4.517
  3. Bloch M., Morávek J., Bounds of the number of threshold functions, Information Processing Machines, Praha 1967. (1967) 
  4. Winder R. O., Bounds of threshold gate readability, TRNS IEEE EC - 12, Oct. 63. 
  5. Нечипорук E. И., О синтезе схем из пороговых элементов. Проблемы кибернетики, том 11, Москва 1964. (1964) Zbl1117.65300
  6. Goldman A. J., Tucker A. W., Polyhedral Convex Cones, Linear Inequalities and Related Systems, Princeton 1956. (1956) MR0087974
  7. Ford L. R., Fulkerson D. R., Flows in Networks, Princeton 1962. (1962) Zbl0106.34802MR0159700
  8. Bellman R. E., Dynamic Programming Treatment of the Travelling Salesman Problem, J. Assoc. for Соmр. Mach. 9, 61 - 63 (1962). (1962) Zbl0106.14102MR0135702
  9. Little J. D. C., Murty K. G., Sweeney D. W., and Karel C., 10.1287/opre.11.6.972, Opns. Res. 11, 972-989, 1963. (1963) DOI10.1287/opre.11.6.972
  10. Vlach M., Řešení dopravního problému metodou větvení, Ekonomicko-matematický obzor, 2, N. 4, 1966. (1966) 
  11. Yajima S., Ibaraki T., A lower Bound of the Number of Threshold Functions, IEEE, EC Dec. 1965, Vol. 14, N. 6. (1965) Zbl0197.43606
  12. Morávek J., О некоторых оценках для пороговых функций, Term paper, Leningrad University, 1963. (1963) 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.