R. Armstrong

发表

Minimizing Weighted Absolute Deviation in Single Machine Scheduling

J. Blackstone, T. Fry, R. Armstrong, 1987 .

Implementation and analysis of a variant of the dual method for the capacitated transshipment problem

Ronald D. Armstrong, Darwin Klingman, David Whitman, 1980 .

Priority Ranking and Consensus Formation: The Case of Ties

L. Seiford, W. Cook, R. Armstrong, 1982 .

Strongly polynomial dual simplex methods for the maximum flow problem

Ronald D. Armstrong, Wei Chen, Donald Goldfarb, 1998, Math. Program..

An O(N log (1/ɛ)) Algorithm for the Two-resource Allocation Problem with a Non-differentiable Convex Objective Function

R. Armstrong, L. Lei, S. Gu, 1995 .

A Comparison of Two Algorithms for Absolute Deviation Curve Fitting

Edward L. Frome, R. D. Armstrong, R. Armstrong, 1976 .

Least‐absolute‐value estimators for one‐way and two‐way tables

R. Armstrong, E. Frome, 1979 .

A greedy algorithm to determine the number of transporters in a cyclic electroplating process

Ronald D. Armstrong, Lei Lei, Shanhong Gu, 1996 .

Obtaining least absolute value estimates for a two-way classification model

John W. Hultz, J. Elam, R. Armstrong, 1977 .

An Algorithm for a Nonlinear Discontinuous Knapsack Problem

W. Cook, F. Palacios-Gómez, R. Armstrong, 1979 .

An algorithm for a least absolute value regression problem with bounds on the parameters

R. Armstrong, M. Kung, 1980 .

Investment sequencing and allocation decisions in water resource system design: A note on an alternative algorithm

R. Armstrong, C. Willis, 1979 .

A linear programming algorithm for curve fitting in the L∞ norm

M. G. Sklar, R. Armstrong, 1980 .

A special purpose linear programming algorithm for obtaining least absolute value estimators in a linear model with dummy variables

R. Armstrong, E. Frome, 1977 .

Application of Quasi-Integer Programming to the Solution of Menu Planning Problems with Variable Portion Size

Ronald D. Armstrong, Prabhakant Sinha, R. Armstrong, 1974 .

Effective Solution of Non-Convex Multi-Objective Ratio Goals Problems.

Abraham Charnes, W W Cooper, C. Haksever, 1980 .

Linear Programming in Exploratory Data Analysis

M. G. Sklar, R. Armstrong, E. Frome, 1980 .

An Algorithm to Select the Best Subset for a Least Absolute Value Regression Problem

R. Armstrong, M. Kung, 1981 .

Two linear programming algorithms for the linear discrete ₁ norm problem

R. Armstrong, J. P. Godfrey, 1979 .

Priority ranking and minimal disagreement : a weak ordering model

L. Seiford, W. Cook, R. Armstrong, 1982 .

Robust estimation procedures and visual display techniques for a two-way classification model

Ronald D. Armstrong, Michael G. Sklar, M. G. Sklar, 1994 .

Implementation and analysis of alternative algorithms for generalized shortest path problems

Ronald D. Armstrong, Darwin D. Klingman, Parviz Partow-Navid, 1985, Comput. Oper. Res..

Page cuts for integer interval linear programming

Ronald D. Armstrong, Abraham Charnes, F. Phillips, 1979, Discret. Appl. Math..

The best parameter subset using the Chebychev curve fitting criterion

Ronald D. Armstrong, Philip Beck, R. Armstrong, 1983, Math. Program..

A dual method for discrete Chebychev curve fitting

Ronald D. Armstrong, David S. Kung, R. Armstrong, 1979, ACM '78.

A zero-inventory production and distribution problem with a fixed customer sequence

Lei Lei, Su Gao, Ronald Armstrong, 2008, Ann. Oper. Res..

Min‐Max Estimates for a Linear Multiple Regression Problem

Ronald D. Armstrong, David S. Kung, R. Armstrong, 1979 .

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

Ronald D. Armstrong, Prabhakant Sinha, R. Armstrong, 1974, Math. Program..

A Branch-and-Bound Solution of a Restricted Least Squares Problem

E. L. Frome, R. D. Armstrong, R. Armstrong, 1976 .

Least absolute value and chebychev estimation utilizing least squares results

Ronald D. Armstrong, Michael G. Sklar, M. G. Sklar, 1982, Math. Program..

A computational study of a multiple-choice knapsack algorithm

Ronald D. Armstrong, Prabhakant Sinha, Andris A. Zoltners, 1983, TOMS.

The contract formation problem in preventive pavement maintenance: A fixed-charge goal programming model

Ronald D. Armstrong, Wade D. Cook, W. Cook, 1981 .

A new strongly polynomial dual network simplex algorithm

Ronald D. Armstrong, Zhiying Jin, R. Armstrong, 1997, Math. Program..

Least Absolute Value Estimates for a Simple Linear Regression Problem

Ronald D. Armstrong, Mabel Tam Kung, R. Armstrong, 1978 .

An Efficient Algorithm for a Class of Two-Resource Allocation Problems

R. Armstrong, S. Gu, L. Lei, 1998, INFORMS J. Comput..

Minimizing the fleet size with dependent time-window and single-track constraints

Lei Lei, Shanhong Gu, Ronald Armstrong, 1993, Oper. Res. Lett..

Successive linear programming for ratio goal problems

Ronald D. Armstrong, Abraham Charnes, C. Haksever, 1987 .

Vector extremal systems in cross-constrained games of regulatory policy analysis and synthesis

Abraham Charnes, Zhimin Huang, J. J. Rousseau, 1993 .

Optimal Batching in a Semi-Automated Order Picking System

Ronald D. Armstrong, Wade D. Cook, Alan L. Saipe, 1979 .

A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints

Ronald D. Armstrong, Lei Lei, Shanhong Gu, 1994 .

CUSUM Hypothesis Tests and Alternative Response Probabilities for Finite Poisson Trials

Ronald D. Armstrong, Mabel Tam Kung, R. Armstrong, 2011, Commun. Stat. Simul. Comput..

A Zero-Inventory Production-Distribution Problem with Time-Window Constraints

R. Armstrong, L. Lei, S. Gao, 2008 .

The Multiple-Choice Nested Knapsack Model

Ronald D. Armstrong, Prabhakant Sinha, Andris A. Zoltners, 1982 .