Resultats globals: 1 registres trobats en 0.02 segons.
Articles, 1 registres trobats
Articles 1 registres trobats  
1.
18 p, 973.6 KB A new strongly polynomial dual network simplex algorithm / Armstrong, Ronald D. ; Jin, Zhiying
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 131-148  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.