Resultats globals: 5 registres trobats en 0.02 segons.
Articles, 5 registres trobats
Articles 5 registres trobats  
1.
17 p, 910.0 KB Linear programming, the simplex algorithm and simple polytopes / Kalai, Gil
In the first part of the paper we survey some far-reaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 217-233  
 Accés restringit a la UAB
2.
23 p, 998.3 KB Flows on hypergraphs / Cambini, Riccardo ; Gallo, Giorgio ; Scutellà, Maria Grazia
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 195-217  
 Accés restringit a la UAB
3.
10 p, 591.4 KB A new pivot selection rule for the network simplex algorithm / Sokkalingam, P. T. ; Sharma, Prabha ; Ahuja, Ravindra K.
We present a new network simplex pivot selection rule, which we call the minimum ratio pivot rule, and analyze the worst-case complexity of the resulting network simplex algorithm. We consider networks with n nodes, m arcs, integral arc capacities and integral supplies/demands of nodes. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 149-158  
 Accés restringit a la UAB
4.
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
5.
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.