| |
| 1999 | ||
|---|---|---|
| 4 | EE | Donald Goldfarb, Zhiying Jin: A new scaling algorithm for the minimum cost network flow problem. Oper. Res. Lett. 25(5): 205-211 (1999) |
| 1998 | ||
| 3 | Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin: Strongly polynomial dual simplex methods for the maximum flow problem. Math. Program. 80: 17-33 (1998) | |
| 1997 | ||
| 2 | Ronald D. Armstrong, Zhiying Jin: A new strongly polynomial dual network simplex algorithm. Math. Program. 77: 131-148 (1997) | |
| 1996 | ||
| 1 | EE | Ronald D. Armstrong, Zhiying Jin: Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing. Discrete Applied Mathematics 64(2): 97-103 (1996) |
| 1 | Ronald D. Armstrong | [1] [2] [3] |
| 2 | Wei Chen | [3] |
| 3 | Donald Goldfarb | [3] [4] |