Ronald D. Armstrong

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