The following pages link to Ronald D. Armstrong (Q976383):
Displaying 50 items.
- (Q754754) (redirect page) (← links)
- Page cuts for integer interval linear programming (Q754756) (← links)
- Determining targets for multi-stage adaptive tests using integer programming (Q976386) (← links)
- A linked list data structure for a simple linear regression algorithm (Q1085037) (← links)
- Implementation and analysis of alternative algorithms for generalized shortest path problems (Q1086499) (← links)
- Implementation of successive linear programming algorithms for non-convex goal programming (Q1093528) (← links)
- Successive linear programming for ratio goal problems (Q1099080) (← links)
- Implementation and analysis of a variant of the dual method for the capacitated transshipment problem (Q1143947) (← links)
- An algorithm for a least absolute value regression problem with bounds on the parameters (Q1145473) (← links)
- Solving linear bottleneck assignment problems via strong spanning trees (Q1200788) (← links)
- Lagrangian approach for large-scale least absolute value estimation (Q1201859) (← links)
- A new strongly polynomial dual network simplex algorithm (Q1373742) (← links)
- Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← links)
- On solving a variation of the assignment problem (Q1390267) (← links)
- Single machine scheduling to minimize mean absolute lateness: A heuristic solution (Q1823851) (← links)
- Strongly polynomial simplex algorithm for bipartite vertex packing (Q1917242) (← links)
- A constraint programming approach to extract the maximum number of non-overlapping test forms (Q2506175) (← links)
- A branch and bound procedure to minimize mean absolute lateness on a single processor (Q2563889) (← links)
- Distributions of the Kullback-Leibler divergence with applications (Q3018641) (← links)
- (Q3026743) (← links)
- CUSUM Hypothesis Tests and Alternative Response Probabilities for Finite Poisson Trials (Q3087584) (← links)
- Brief note a routing problem for a plant nursery (Q3221752) (← links)
- Least absolute value and chebychev estimation utilizing least squares results (Q3321322) (← links)
- Algorithm 615: the best subset of parameters in leasst absolute value regression (Q3334042) (← links)
- An algorithm for discrete chebychev curve fitting for the simple model using a dual linear programming approach (Q3339239) (← links)
- A computational study of a multiple-choice knapsack algorithm (Q3657427) (← links)
- The best parameter subset using the Chebychev curve fitting criterion (Q3662506) (← links)
- (Q3673897) (← links)
- Penalty calculations and branching rules in a LAV best subset procedure (Q3721627) (← links)
- Two Linear Programming Algorithms for the Linear Discrete L 1 Norm Problem (Q3857591) (← links)
- Algorithm AS 132: Least Absolute Value Estimates for a Simple Linear Regression Problem (Q3878571) (← links)
- A revised simplex algorithm for the absolute deviation curve fitting problem (Q3881823) (← links)
- A dual method for discrete Chebychev curve fitting (Q3885510) (← links)
- A linear programming algorithm for curve fitting in the L<sub>∞</sub>norm (Q3894859) (← links)
- Algorithm AS 135: Min-Max Estimates for a Linear Multiple Regression Problem (Q3902452) (← links)
- (Q3910315) (← links)
- (Q3929343) (← links)
- Priority Ranking and Consensus Formation: The Case of Ties (Q3947410) (← links)
- A Dual Algorithm to Solve Linear Least Absolute Value Problems (Q3951906) (← links)
- The Multiple-Choice Nested Knapsack Model (Q3956742) (← links)
- Priority ranking and minimal disagreement : a weak ordering model (Q3970118) (← links)
- Application of Quasi-Integer Programming to the Solution of Menu Planning Problems with Variable Portion Size (Q4062227) (← links)
- Improved penalty calculations for a mixed integer branch-and-bound algorithm (Q4079323) (← links)
- A Comparison of Two Algorithms for Absolute Deviation Curve Fitting (Q4113268) (← links)
- A Chance Constrained Multiple Choice Programming Algorithm (Q4121707) (← links)
- Simultaneous Investment and Allocation Decisions Applied to Water Planning (Q4126021) (← links)
- A Branch-and-Bound Solution of a Restricted Least Squares Problem (Q4133423) (← links)
- An Algorithm for a Restricted Discrete Approximation Problem in the $L_1 $ Norm (Q4144118) (← links)
- The cyclic separation scheduling problem (Q4149196) (← links)
- A primal simplex algorithm to solve a rectilinear distance facility location problem (Q4149215) (← links)
