Mironov Andrei Aleksandrovich

Publications in Math-Net.Ru

1. Closed Transportation Models with Minimax Criterion
   
   Avtomat. i Telemekh., 2002, no. 3,  50–61
2. Convex polyhedra in network optimization problems
   
   Zh. Vychisl. Mat. Mat. Fiz., 42:5 (2002),  729–740
3. The method of convex linear combinations and the lattice duality principle in transportation-type problems
   
   Avtomat. i Telemekh., 2000, no. 12,  22–34
4. A triplanar transportation problem with a minimax criterion
   
   Dokl. Akad. Nauk, 351:6 (1996),  743–746
5. Uniform generalized graphs
   
   Dokl. Akad. Nauk, 351:4 (1996),  465–468
6. Transportation problems with a minimax criterion
   
   Dokl. Akad. Nauk, 346:2 (1996),  168–171
7. Transport-type problems with a minimax criterion
   
   Avtomat. i Telemekh., 1995, no. 12,  109–118
8. Transport and network problems with the minimax criterion
   
   Zh. Vychisl. Mat. Mat. Fiz., 35:1 (1995),  24–45
9. A class of distribution problems with a minimax criterion
   
   Dokl. Akad. Nauk, 336:1 (1994),  35–38
10. Generalized graphs with restrictions for degrees of vertices
    
    Dokl. Akad. Nauk, 333:4 (1993),  437–439
11. Approximation and decomposition by extremal graphs
    
    Zh. Vychisl. Mat. Mat. Fiz., 33:2 (1993),  283–298
12. Properties of sets of degrees of vertices of generalized graphs
    
    Dokl. Akad. Nauk, 324:5 (1992),  959–963
13. Geometry of the points of the space $R^n$ that are realizable into a graph
    
    Uspekhi Mat. Nauk, 32:6(198) (1977),  231–232