Ronald D. Armstrong - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2011

CUSUM Hypothesis Tests and Alternative Response Probabilities for Finite Poisson TrialsRonald D. Armstrong, Mabel Tam Kung. cssc, 40(7):1057-1073, 2011. [doi]

2010

Determining targets for multi-stage adaptive tests using integer programmingRonald D. Armstrong, Mabel Tam Kung, Louis A. Roussos. eor, 205(3):709-718, 2010. [doi]

2006

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test FormsDmitry I. Belov, Ronald D. Armstrong. coap, 33(2-3):319-332, 2006. [doi]

A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test FormsDmitry I. Belov, Ronald D. Armstrong. coap, 35(1):127-128, 2006. [doi]

1998

Strongly polynomial dual simplex methods for the maximum flow problemRonald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin. mp, 80:17-33, 1998.

1997

A new strongly polynomial dual network simplex algorithmRonald D. Armstrong, Zhiying Jin. mp, 77:131-148, 1997.

1996

Strongly Polynomial Simplex Algorithm for Bipartite Vertex PackingRonald D. Armstrong, Zhiying Jin. DAM, 64(2):97-103, 1996. [doi]

A branch and bound procedure to minimize mean absolute lateness on a single processorTimothy D. Fry, Ronald D. Armstrong, Ken Darby-Dowman, Patrick R. Philipoom. cor, 23(2):171-182, 1996. [doi]

1993

Lagrangian approach for large-scale least absolute value estimationMichael G. Sklar, Ronald D. Armstrong. cor, 20(1):83-93, 1993. [doi]

1992

Solving linear bottleneck assignment problems via strong spanning treesRonald D. Armstrong, Zhiying Jin. orl, 12(3):179-180, 1992. [doi]

1990

Single machine scheduling to minimize mean absolute lateness: A heuristic solutionTimothy D. Fry, Ronald D. Armstrong, L. Drew Rosen. cor, 17(1):105-112, 1990. [doi]

Heuristics for Scheduling Aircraft and Crew during Airlift OperationsMichael G. Sklar, Ronald D. Armstrong, S. Samn. transci, 24(1):63-76, 1990. [doi]

1988

Implementation of successive linear programming algorithms for non-convex goal programmingRonald D. Armstrong, Abraham Charnes, Cengiz Haksever. cor, 15(1):37-49, 1988. [doi]

1985

Implementation and analysis of alternative algorithms for generalized shortest path problemsDarwin D. Klingman, Ronald D. Armstrong, Parviz Partow-Navid. cor, 12(1):39-49, 1985. [doi]

1984

A linked list data structure for a simple linear regression algorithmRonald D. Armstrong, Mabel Tam Kung. cor, 11(3):295-305, 1984. [doi]

Algorithm 615: the best subset of parameters in leasst absolute value regressionRonald D. Armstrong, P. O. Beck, Mabel Tam Kung. TOMS, 10(2):202-206, 1984. [doi]

1983

A computational study of a multiple-choice knapsack algorithmRonald D. Armstrong, David S. Kung 0002, P. Sinha, Andris A. Zoltners. TOMS, 9(2):184-198, 1983. [doi]

The best parameter subset using the Chebychev curve fitting criterionRonald D. Armstrong, Philip O. Beck. mp, 27(1):64-74, 1983. [doi]

A linear programming algorithm for the simple model for discrete chebychev curve fittingMichael G. Sklar, Ronald D. Armstrong. cor, 10(3):237-248, 1983. [doi]

1982

Least absolute value and chebychev estimation utilizing least squares resultsMichael G. Sklar, Ronald D. Armstrong. mp, 24(1):346-352, 1982. [doi]

1980

A dual method for discrete Chebychev curve fittingRonald D. Armstrong, David S. Kung 0002. mp, 19(1):186-199, 1980. [doi]

1979

Page cuts for integer interval linear programmingRonald D. Armstrong, Abraham Charnes, F. Phillips. DAM, 1(1-2):1-14, 1979. [doi]

1978

A dual method for discrete Chebychev curve fittingRonald D. Armstrong, David S. Kung 0002. acm 1978: 946-953 [doi]

1975

A Chance Constrained Multiple Choice Programming AlgorithmRonald D. Armstrong, Joseph L. Balintfy. ior, 23(3):494-510, 1975. [doi]

1974

Improved penalty calculations for a mixed integer branch-and-bound algorithmRonald D. Armstrong, Prabhakant Sinha. mp, 6(1):212-223, 1974. [doi]

Sign in or sign up to see more results.

runs on WebDSL