Zhiying Jin

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4789391	2003-04-28	Paper
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem	2002-02-07	Paper
A polynomial dual simplex algorithm fot the generalized circulation problem.	2002-01-01	Paper
A new scaling algorithm for the minimum cost network flow problem	2000-12-12	Paper
Optimal designs for simultaneous item estimation	1998-08-16	Paper
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem	1998-08-03	Paper
On solving a variation of the assignment problem	1998-07-14	Paper
Strongly polynomial dual simplex methods for the maximum flow problem	1998-03-11	Paper
A new strongly polynomial dual network simplex algorithm	1997-11-25	Paper
A Faster Combinatorial Algorithm for the Generalized Circulation Problem	1997-10-30	Paper
Strongly polynomial simplex algorithm for bipartite vertex packing	1996-07-07	Paper
Optimal sequential designs for on-line item estimation	1995-11-28	Paper
Solving linear bottleneck assignment problems via strong spanning trees	1993-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q3358132	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3474822	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3761569	1987-01-01	Paper

No records found.

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Zhiying Jin