Armstrong Ronald D.

Ronald D. Armstrong

Information about the author Ronald D. Armstrong will soon be added to the site.
Found 9 papers in total
Single machine scheduling to minimize mean absolute lateness: A heuristic solution
Single machine scheduling to minimize mean absolute lateness: A heuristic solution
1990
This paper presents a heuristic solution procedure based on the well known methodology...
A constraint programming approach to extract the maximum number of non-overlapping test forms
A constraint programming approach to extract the maximum number of non-overlapping test forms
2006
This paper introduces a novel approach for extracting the maximum number of...
Strongly polynomial dual simplex methods for the maximum flow problem
Strongly polynomial dual simplex methods for the maximum flow problem
1998
This paper presents dual network simplex algorithms that require at most 2 nm pivots...
A new strongly polynomial dual network simplex algorithm
A new strongly polynomial dual network simplex algorithm
1997
This paper presents a new dual network simplex algorithm for the minimum cost network...
Solving a class of two-resource allocation problem by equivalent load method
Solving a class of two-resource allocation problem by equivalent load method
1997
We present an efficient algorithm for solving a class of two-resource allocation...
On solving a variation of the assignment problem
On solving a variation of the assignment problem
1995
Geetha and Nair recently proposed a variant of n × n assignment problem with the...
A Branch and Bound procedure to minimize Mean Absolute Lateness on a single processor
A Branch and Bound procedure to minimize Mean Absolute Lateness on a single processor
1996
This paper presents a solution procedure to minimize the Mean Absolute Lateness single...
Lagrangian approach for large scale least absolute value estimation
Lagrangian approach for large scale least absolute value estimation
1993
With the proliferation of personal computers and the increased interest in robust...
Solving linear bottleneck assignment problems via strong spanning trees
Solving linear bottleneck assignment problems via strong spanning trees
1992
An efficient algorithm for solving the n×n linear bottleneck assignment problem...
Papers per page: