The SCEAS System
Navigation Menu

Search the dblp DataBase


Ronald D. Armstrong: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ronald D. Armstrong, D. S. Kung
    A dual method for discrete Chebychev curve fitting. [Citation Graph (0, 0)][DBLP]
    ACM Annual Conference (2), 1978, pp:946-953 [Conf]
  2. Ronald D. Armstrong, Abraham Charnes, Cengiz Haksever
    Implementation of successive linear programming algorithms for non-convex goal programming. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1988, v:15, n:1, pp:37-49 [Journal]
  3. Ronald D. Armstrong, Mabel Tam Kung
    A linked list data structure for a simple linear regression algorithm. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1984, v:11, n:3, pp:295-305 [Journal]
  4. Timothy D. Fry, Ronald D. Armstrong, Ken Darby-Dowman, Patrick R. Philipoom
    A branch and bound procedure to minimize mean absolute lateness on a single processor. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1996, v:23, n:2, pp:171-182 [Journal]
  5. Timothy D. Fry, Ronald D. Armstrong, L. Drew Rosen
    Single machine scheduling to minimize mean absolute lateness: A heuristic solution. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1990, v:17, n:1, pp:105-112 [Journal]
  6. Darwin D. Klingman, Ronald D. Armstrong, Parviz Partow-Navid
    Implementation and analysis of alternative algorithms for generalized shortest path problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1985, v:12, n:1, pp:39-49 [Journal]
  7. Michael G. Sklar, Ronald D. Armstrong
    A linear programming algorithm for the simple model for discrete chebychev curve fitting. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1983, v:10, n:3, pp:237-248 [Journal]
  8. Michael G. Sklar, Ronald D. Armstrong
    Lagrangian approach for large-scale least absolute value estimation. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1993, v:20, n:1, pp:83-93 [Journal]
  9. Ronald D. Armstrong, Zhiying Jin
    Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:64, n:2, pp:97-103 [Journal]
  10. Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin
    Strongly polynomial dual simplex methods for the maximum flow problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:80, n:, pp:17-33 [Journal]
  11. Ronald D. Armstrong, Zhiying Jin
    A new strongly polynomial dual network simplex algorithm. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:77, n:, pp:131-148 [Journal]

Search in 0.006secs, Finished in 0.008secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002