Resultats globals: 1 registres trobats en 0.02 segons.
Articles, 1 registres trobats
Articles 1 registres trobats  
1.
21 p, 1.1 MB A polynomial time primal network simplex algorithm for minimum cost flows / Orlin, James B.
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we develop one such algorithm that runs in O(min(n^2m log nC, n^2m^2 log n)) time, where n is the number of nodes in the network, m is the number of arcs, and C denotes the maximum absolute arc costs if arc costs are integer and (infin) otherwise. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 109-129  
 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.