Jin Zhiying

Zhiying Jin

Information about the author Zhiying Jin will soon be added to the site.
Found 7 papers in total
A new scaling algorithm for the minimum cost network flow problem
A new scaling algorithm for the minimum cost network flow problem
1999
In this paper, we present a new polynomial time algorithm for solving the minimum cost...
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem
1997
The paper presents two new combinatorial algorithms for the generalized circulation...
An O(nm)-time network simplex algorithm for the shortest path problem
An O(nm)-time network simplex algorithm for the shortest path problem
1999
We present an O(nm) -time network simplex algorithm for finding a tree of shortest...
Strongly polynomial dual simplex methods for the maximum flow problem
Strongly polynomial dual simplex methods for the maximum flow problem
1998
This paper presents dual network simplex algorithms that require at most 2 nm pivots...
A new strongly polynomial dual network simplex algorithm
A new strongly polynomial dual network simplex algorithm
1997
This paper presents a new dual network simplex algorithm for the minimum cost network...
On solving a variation of the assignment problem
On solving a variation of the assignment problem
1995
Geetha and Nair recently proposed a variant of n × n assignment problem with the...
Solving linear bottleneck assignment problems via strong spanning trees
Solving linear bottleneck assignment problems via strong spanning trees
1992
An efficient algorithm for solving the n×n linear bottleneck assignment problem...
Papers per page: