Geodesic
Approximate solution of the problem of minimizing of development cost
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 21 (1966) no. 1
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{RM_1966_21_1_a10,
     author = {V. A. Belonogov and I. E. Maizlin},
     title = {Approximate solution of the problem of minimizing of development cost},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     year = {1966},
     volume = {21},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/RM_1966_21_1_a10/}
}
TY  - JOUR
AU  - V. A. Belonogov
AU  - I. E. Maizlin
TI  - Approximate solution of the problem of minimizing of development cost
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 1966
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/RM_1966_21_1_a10/
LA  - ru
ID  - RM_1966_21_1_a10
ER  - 
%0 Journal Article
%A V. A. Belonogov
%A I. E. Maizlin
%T Approximate solution of the problem of minimizing of development cost
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 1966
%V 21
%N 1
%U http://geodesic.mathdoc.fr/item/RM_1966_21_1_a10/
%G ru
%F RM_1966_21_1_a10
V. A. Belonogov; I. E. Maizlin. Approximate solution of the problem of minimizing of development cost. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 21 (1966) no. 1. http://geodesic.mathdoc.fr/item/RM_1966_21_1_a10/

[1] J. Kelly, “Critical-path planning and scheduling mathematical basis”, Operations Research, 9:3 (1961) | MR

[2] L. R. Ford, D. R. Fulkerson, “A simple algoithm for finiding maximal network flows and an application to the Hitchcock problem”, Canad. Jorn. Math., 9:2 (1957) | MR | Zbl

[3] I. E. Maizlin, L. P. Nikolaeva, “Opredelenie na EVM metodom statisticheskikh ispytanii funktsii raspredeleniya vremeni okonchaniya razrabotok pri setevom planirovanii”, Izv. AN. Tekhnicheskaya kibernetika, 1965, no. 3