Zhiying Jin

According to our database, Zhiying Jin authored at least 10 papers between 1992 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

A Self-Driven Microfluidic Chip for Ricin and Abrin Detection.

Xuexin Bai, Chenyi Hu, Liang Chen, Jing Wang, Yanwei Li, Wei Wan, Zhiying Jin, Yue Li, Wenwen Xin, Lin Kang, Han Jin, Hao Yang, Jinglin Wang, Shan Gao

Sensors, 2022

2002

A polynomial dual simplex algorithm for the generalized circulation problem.

Donald Goldfarb, Zhiying Jin, Yiqing Lin

Math. Program., 2002

1999

A new scaling algorithm for the minimum cost network flow problem.

Donald Goldfarb, Zhiying Jin

Oper. Res. Lett., 1999

An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem.

Donald Goldfarb, Zhiying Jin

Oper. Res., 1999

1998

Strongly polynomial dual simplex methods for the maximum flow problem.

Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin

Math. Program., 1998

1997

A new strongly polynomial dual network simplex algorithm.

Ronald D. Armstrong, Zhiying Jin

Math. Program., 1997

Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem.

Donald Goldfarb, Zhiying Jin, James B. Orlin

Math. Oper. Res., 1997

1996

A Faster Combinatorial Algorithm for the Generalized Circulation Problem.

Donald Goldfarb, Zhiying Jin

Math. Oper. Res., 1996

Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing.

Ronald D. Armstrong, Zhiying Jin

Discret. Appl. Math., 1996

1992

Solving linear bottleneck assignment problems via strong spanning trees.

Ronald D. Armstrong, Zhiying Jin

Oper. Res. Lett., 1992