Results 131 to 139 of about 15,299 (139)
Some of the next articles are maybe not open access.
A Strongly Polynomial Algorithm for Generalized Flow Maximization
Mathematics of Operations Research, 2017László A Vegh
exaly
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
SIAM Journal on Discrete Mathematics, 2005Satoru Iwata +2 more
exaly
Polynomial and Strongly Polynomial Algorithms for Convex Network Optimization
1993openaire +1 more source
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
Operations Research Letters, 2004Akiyoshi Shioura
exaly
A faster strongly polynomial time algorithm to solve the minimum cost tension problem
Journal of Combinatorial Optimization, 2016Mehdi Ghiyasvand
exaly
A strongly polynomial algorithm for a new class of linear inequalities1
Optimization, 1995Frank Werner
exaly
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
Operations Research Letters, 1991Donald Goldfarb
exaly