| 1998 |
|---|
| 11 | | 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 |
|---|
| 10 | | Ronald D. Armstrong,
Zhiying Jin:
A new strongly polynomial dual network simplex algorithm.
Math. Program. 77: 131-148 (1997) |
| 1996 |
|---|
| 9 | EE | Timothy D. Fry,
Ronald D. Armstrong,
Ken Darby-Dowman,
Patrick R. Philipoom:
A branch and bound procedure to minimize mean absolute lateness on a single processor.
Computers & OR 23(2): 171-182 (1996) |
| 8 | EE | Ronald D. Armstrong,
Zhiying Jin:
Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing.
Discrete Applied Mathematics 64(2): 97-103 (1996) |
| 1993 |
|---|
| 7 | EE | Michael G. Sklar,
Ronald D. Armstrong:
Lagrangian approach for large-scale least absolute value estimation.
Computers & OR 20(1): 83-93 (1993) |
| 1990 |
|---|
| 6 | EE | Timothy D. Fry,
Ronald D. Armstrong,
L. Drew Rosen:
Single machine scheduling to minimize mean absolute lateness: A heuristic solution.
Computers & OR 17(1): 105-112 (1990) |
| 1988 |
|---|
| 5 | EE | Ronald D. Armstrong,
Abraham Charnes,
Cengiz Haksever:
Implementation of successive linear programming algorithms for non-convex goal programming.
Computers & OR 15(1): 37-49 (1988) |
| 1985 |
|---|
| 4 | EE | Darwin D. Klingman,
Ronald D. Armstrong,
Parviz Partow-Navid:
Implementation and analysis of alternative algorithms for generalized shortest path problems.
Computers & OR 12(1): 39-49 (1985) |
| 1984 |
|---|
| 3 | EE | Ronald D. Armstrong,
Mabel Tam Kung:
A linked list data structure for a simple linear regression algorithm.
Computers & OR 11(3): 295-305 (1984) |
| 1983 |
|---|
| 2 | EE | Michael G. Sklar,
Ronald D. Armstrong:
A linear programming algorithm for the simple model for discrete chebychev curve fitting.
Computers & OR 10(3): 237-248 (1983) |
| 1978 |
|---|
| 1 | EE | Ronald D. Armstrong,
David S. Kung:
A dual method for discrete Chebychev curve fitting.
ACM Annual Conference (2) 1978: 946-953 |
