Ronald D. Armstrong

Publication Activity (10 Years)

Years Active: 1974-2011
Publications (10 Years): 0

Publications

Ronald D. Armstrong, Mabel Tam Kung
CUSUM Hypothesis Tests and Alternative Response Probabilities for Finite Poisson Trials. Commun. Stat. Simul. Comput. 40 (7) (2011)
Ronald D. Armstrong, Mabel Tam Kung, Louis A. Roussos
Determining targets for multi-stage adaptive tests using integer programming. Eur. J. Oper. Res. 205 (3) (2010)
Dmitry I. Belov, Ronald D. Armstrong
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms. Comput. Optim. Appl. 35 (1) (2006)
Dmitry I. Belov, Ronald D. Armstrong
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms. Comput. Optim. Appl. 33 (2-3) (2006)
Ronald D. Armstrong, Dmitry I. Belov, Alexander Weissman
Developing and Assembling the Law School Admission Test. Interfaces 35 (2) (2005)
Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin
Strongly polynomial dual simplex methods for the maximum flow problem. Math. Program. 80 (1998)
Ronald D. Armstrong, Zhiying Jin
A new strongly polynomial dual network simplex algorithm. Math. Program. 77 (1997)
Ronald D. Armstrong, Zhiying Jin
Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing. Discret. Appl. Math. 64 (2) (1996)
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. Comput. Oper. Res. 23 (2) (1996)
Michael G. Sklar, Ronald D. Armstrong
Lagrangian approach for large-scale least absolute value estimation. Comput. Oper. Res. 20 (1) (1993)
Ronald D. Armstrong, Zhiying Jin
Solving linear bottleneck assignment problems via strong spanning trees. Oper. Res. Lett. 12 (3) (1992)
Michael G. Sklar, Ronald D. Armstrong, S. Samn
Heuristics for Scheduling Aircraft and Crew during Airlift Operations. Transp. Sci. 24 (1) (1990)
Timothy D. Fry, Ronald D. Armstrong, L. Drew Rosen
Single machine scheduling to minimize mean absolute lateness: A heuristic solution. Comput. Oper. Res. 17 (1) (1990)
Ronald D. Armstrong, Abraham Charnes, Cengiz Haksever
Implementation of successive linear programming algorithms for non-convex goal programming. Comput. Oper. Res. 15 (1) (1988)
Darwin D. Klingman, Ronald D. Armstrong, Parviz Partow-Navid
Implementation and analysis of alternative algorithms for generalized shortest path problems. Comput. Oper. Res. 12 (1) (1985)
Ronald D. Armstrong, Mabel Tam Kung
A linked list data structure for a simple linear regression algorithm. Comput. Oper. Res. 11 (3) (1984)
Ronald D. Armstrong, Philip O. Beck, Mabel Tam Kung
Algorithm 615: the best subset of parameters in leasst absolute value regression. ACM Trans. Math. Softw. 10 (2) (1984)
Ronald D. Armstrong, Philip O. Beck
The best parameter subset using the Chebychev curve fitting criterion. Math. Program. 27 (1) (1983)
Michael G. Sklar, Ronald D. Armstrong
A linear programming algorithm for the simple model for discrete chebychev curve fitting. Comput. Oper. Res. 10 (3) (1983)
Ronald D. Armstrong, David S. Kung, Prabhakant Sinha, Andris A. Zoltners
A computational study of a multiple-choice knapsack algorithm. ACM Trans. Math. Softw. 9 (2) (1983)
Michael G. Sklar, Ronald D. Armstrong
Least absolute value and chebychev estimation utilizing least squares results. Math. Program. 24 (1) (1982)
Ronald D. Armstrong, David S. Kung
A dual method for discrete Chebychev curve fitting. Math. Program. 19 (1) (1980)
Ronald D. Armstrong, Abraham Charnes, F. Phillips
Page cuts for integer interval linear programming. Discret. Appl. Math. 1 (1-2) (1979)
Ronald D. Armstrong, David S. Kung
A dual method for discrete Chebychev curve fitting. ACM Annual Conference (2) (1978)
Ronald D. Armstrong, Joseph L. Balintfy
A Chance Constrained Multiple Choice Programming Algorithm. Oper. Res. 23 (3) (1975)
Ronald D. Armstrong, Prabhakant Sinha
Improved penalty calculations for a mixed integer branch-and-bound algorithm. Math. Program. 6 (1) (1974)