Hao Jianxiu

Jianxiu Hao

Information about the author Jianxiu Hao will soon be added to the site.
Found 3 papers in total
Diagnosing infeasibilities in network flow problems
Diagnosing infeasibilities in network flow problems
1998
We consider the problem of finding a feasible flow in a directed network G = ( N,A )...
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
1991
The authors give a short proof that the network simplex algorithm with either the...
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n2m) time
1990
The authors propose a primal network simplex algorithm for solving the maximum flow...
Papers per page: