Uzdemir Aleksandr Petrovich

Publications in Math-Net.Ru

1. Conversion of the Steiner problem on the euclidean plane to the steiner problem on graph
   
   Avtomat. i Telemekh., 2005, no. 10,  80–92
2. Local optimization in the steiner problem on the euclidean plane
   
   Avtomat. i Telemekh., 2004, no. 7,  60–70
3. Location of Transport Nets on a Heterogeneous Territory
   
   Avtomat. i Telemekh., 2002, no. 7,  117–127
4. Evolving systems - Generalized scheduling problem for discrete manufacture. II
   
   Avtomat. i Telemekh., 1999, no. 4,  103–110
5. The generalized scheduling problem for discrete production. I
   
   Avtomat. i Telemekh., 1999, no. 2,  103–111
6. Mathematical description of economics
   
   Matem. Mod., 7:6 (1995),  126–127
7. Problems of specialization in the machine-building industry
   
   Avtomat. i Telemekh., 1985, no. 10,  88–97
8. Sequential decomposition in optimization problems
   
   Avtomat. i Telemekh., 1980, no. 11,  94–105
9. Dynamic deployment of industries. II
   
   Avtomat. i Telemekh., 1979, no. 12,  146–158
10. Dynamic deployment of industries. I
    
    Avtomat. i Telemekh., 1979, no. 11,  142–151
11. A method for solution of a combinatorial problem of determining the time of factory commissioning
    
    Avtomat. i Telemekh., 1978, no. 10,  142–152
12. Integer dynamic problems of economic planning with network constraints. II
    
    Avtomat. i Telemekh., 1978, no. 9,  110–120
13. Integer dynamic problems of economic planning with network constraints
    
    Avtomat. i Telemekh., 1978, no. 7,  106–115
14. Decomposition in solving the combinatorial problem of determining plant commissioning schedules
    
    Avtomat. i Telemekh., 1977, no. 10,  110–121
15. Estimation problems in a numerical method for solution of a dynamic problem of deploying the enterprises of a sector
    
    Avtomat. i Telemekh., 1977, no. 7,  105–108
16. A method tо solve the parametric problem of finding the circulation of the minimal cost in a network
    
    Avtomat. i Telemekh., 1977, no. 6,  73–84
17. A dynamic problem of research and development planning and a method of its solution
    
    Avtomat. i Telemekh., 1977, no. 1,  62–73
18. A dynamic problem of industry deployment and a numerical solution example. III
    
    Avtomat. i Telemekh., 1976, no. 8,  131–138
19. A dynamic problem of industry deployment and a numerical solution method. II
    
    Avtomat. i Telemekh., 1976, no. 5,  112–121
20. A dynamic problem of industry allocation and a numerical solution example. I
    
    Avtomat. i Telemekh., 1976, no. 4,  120–127
21. Problems in planning batch (custom-mode) production and numerical solutions. III. Minimization of relative r.m.s. capacity overload
    
    Avtomat. i Telemekh., 1976, no. 1,  146–156
22. Problems of planning discrete (custom) production and numerical methods for solving them. II. Numerical methods of solving the problem of minimizing maximal relative power loading
    
    Avtomat. i Telemekh., 1975, no. 10,  90–104
23. Problems of planning individual (custom-made) production and numerical methods of solution. I. Problems of minimizing maximal relative power load
    
    Avtomat. i Telemekh., 1975, no. 9,  115–122


24. Workshop on numerical methods for solution of economic problems
    
    Avtomat. i Telemekh., 1977, no. 10,  179–181