Rank optimization for flow networks
    
    
  
  
  
      
      
      
        
Vestnik KRAUNC. Fiziko-matematičeskie nauki, no. 4 (2018), pp. 178-185
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			In this paper we present an algorithm for constructing an optimal P-rank flow network in a specified redundant geometric graph with potential links of nodes.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
network problem, multiextremality, extremum rank, algorithm.
                    
                  
                
                
                @article{VKAM_2018_4_a17,
     author = {V. Ch. Kudaev and M. B. Abazokov},
     title = {Rank optimization for flow networks},
     journal = {Vestnik KRAUNC. Fiziko-matemati\v{c}eskie nauki},
     pages = {178--185},
     publisher = {mathdoc},
     number = {4},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VKAM_2018_4_a17/}
}
                      
                      
                    V. Ch. Kudaev; M. B. Abazokov. Rank optimization for flow networks. Vestnik KRAUNC. Fiziko-matematičeskie nauki, no. 4 (2018), pp. 178-185. http://geodesic.mathdoc.fr/item/VKAM_2018_4_a17/
