The following pages link to Zhiying Jin (Q233996):
Displayed 16 items.
- Solving linear bottleneck assignment problems via strong spanning trees (Q1200788) (← links)
- A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
- Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← links)
- On solving a variation of the assignment problem (Q1390267) (← links)
- Optimal sequential designs for on-line item estimation (Q1897128) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
- An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem (Q2770116) (← links)
- (Q3358132) (← links)
- (Q3474822) (← links)
- (Q3761569) (← links)
- Optimal designs for simultaneous item estimation (Q4378954) (← links)
- Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem (Q4385161) (← links)
- A Faster Combinatorial Algorithm for the Generalized Circulation Problem (Q4716922) (← links)
- (Q4789391) (← links)
- A polynomial dual simplex algorithm fot the generalized circulation problem. (Q5957566) (← links)