Ronald D. Armstrong

According to our database, Ronald D. Armstrong authored at least 24 papers between 1974 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2011

CUSUM Hypothesis Tests and Alternative Response Probabilities for Finite Poisson Trials.

Ronald D. Armstrong, Mabel Tam Kung

Commun. Stat. Simul. Comput., 2011

2010

Determining targets for multi-stage adaptive tests using integer programming.

Ronald D. Armstrong, Mabel Tam Kung, Louis A. Roussos

Eur. J. Oper. Res., 2010

2006

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms.

Dmitry I. Belov, Ronald D. Armstrong

Comput. Optim. Appl., 2006

2005

Developing and Assembling the Law School Admission Test.

Ronald D. Armstrong, Dmitry I. Belov, Alexander Weissman

Interfaces, 2005

1998

Strongly polynomial dual simplex methods for the maximum flow problem.

Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin

Math. Program., 1998

1997

A new strongly polynomial dual network simplex algorithm.

Ronald D. Armstrong, Zhiying Jin

Math. Program., 1997

1996

Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing.

Ronald D. Armstrong, Zhiying Jin

Discret. Appl. Math., 1996

A branch and bound procedure to minimize mean absolute lateness on a single processor.

Timothy D. Fry, Ronald D. Armstrong, Ken Darby-Dowman, Patrick R. Philipoom

Comput. Oper. Res., 1996

1993

Lagrangian approach for large-scale least absolute value estimation.

Michael G. Sklar, Ronald D. Armstrong

Comput. Oper. Res., 1993

1992

Solving linear bottleneck assignment problems via strong spanning trees.

Ronald D. Armstrong, Zhiying Jin

Oper. Res. Lett., 1992

1990

Heuristics for Scheduling Aircraft and Crew during Airlift Operations.

Michael G. Sklar, Ronald D. Armstrong, S. Samn

Transp. Sci., 1990

Single machine scheduling to minimize mean absolute lateness: A heuristic solution.

Timothy D. Fry, Ronald D. Armstrong, L. Drew Rosen

Comput. Oper. Res., 1990

1988

Implementation of successive linear programming algorithms for non-convex goal programming.

Ronald D. Armstrong, Abraham Charnes, Cengiz Haksever

Comput. Oper. Res., 1988

1985

Implementation and analysis of alternative algorithms for generalized shortest path problems.

Darwin D. Klingman, Ronald D. Armstrong, Parviz Partow-Navid

Comput. Oper. Res., 1985

1984

Algorithm 615: the best subset of parameters in leasst absolute value regression.

Ronald D. Armstrong, Philip O. Beck, Mabel Tam Kung

ACM Trans. Math. Softw., 1984

A linked list data structure for a simple linear regression algorithm.

Ronald D. Armstrong, Mabel Tam Kung

Comput. Oper. Res., 1984

1983

A computational study of a multiple-choice knapsack algorithm.

Ronald D. Armstrong, David S. Kung, Prabhakant Sinha, Andris A. Zoltners

ACM Trans. Math. Softw., 1983

The best parameter subset using the Chebychev curve fitting criterion.

Ronald D. Armstrong, Philip O. Beck

Math. Program., 1983

A linear programming algorithm for the simple model for discrete chebychev curve fitting.

Michael G. Sklar, Ronald D. Armstrong

Comput. Oper. Res., 1983

1982

Least absolute value and chebychev estimation utilizing least squares results.

Michael G. Sklar, Ronald D. Armstrong

Math. Program., 1982

1980

A dual method for discrete Chebychev curve fitting.

Ronald D. Armstrong, David S. Kung

Math. Program., 1980

1979

Page cuts for integer interval linear programming.

Ronald D. Armstrong, Abraham Charnes, F. Phillips

Discret. Appl. Math., 1979

1975

A Chance Constrained Multiple Choice Programming Algorithm.

Ronald D. Armstrong, Joseph L. Balintfy

Oper. Res., 1975

1974

Improved penalty calculations for a mixed integer branch-and-bound algorithm.

Ronald D. Armstrong, Prabhakant Sinha

Math. Program., 1974