Resultats globals: 3 registres trobats en 0.02 segons.
Articles, 3 registres trobats
Articles 3 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
2.
31 p, 1.3 MB Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems / Jansen, Benjamin ; Roos, Kees ; Terlaky, Tamás ; Yoshise, Akiko
This paper provides an analysis of the polynomiality of primal-dual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lipschitz condition, but is also applicable to mappings that are not monotone. [...]
1997
Mathematical Programming, vol. 78 n. 3 (1997) p. 315-345  
 Accés restringit a la UAB
3.
20 p, 972.9 KB On the 0/1 knapsack polytope / Weismantel, Robert
This paper deals with the 0/1 knapsack polytope. In particular, we introduce the class of weight inequalities. This class of inequalities is needed to describe the knapsack polyhedron when the weights of the items lie in certain intervals. [...]
1997
Mathematical Programming, vol. 77 n. 1 (1997) p. 49-68  
 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.