default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald D. Armstrong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j25]Ronald D. Armstrong, Mabel Tam Kung:
CUSUM Hypothesis Tests and Alternative Response Probabilities for Finite Poisson Trials. Commun. Stat. Simul. Comput. 40(7): 1057-1073 (2011)- 2010
- [j24]Ronald D. Armstrong, Mabel Tam Kung, Louis A. Roussos:
Determining targets for multi-stage adaptive tests using integer programming. Eur. J. Oper. Res. 205(3): 709-718 (2010)
2000 – 2009
- 2006
- [j23]Dmitry I. Belov, Ronald D. Armstrong:
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms. Comput. Optim. Appl. 33(2-3): 319-332 (2006) - [j22]Dmitry I. Belov, Ronald D. Armstrong:
A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms. Comput. Optim. Appl. 35(1): 127-128 (2006) - 2005
- [j21]Ronald D. Armstrong, Dmitry I. Belov, Alexander Weissman:
Developing and Assembling the Law School Admission Test. Interfaces 35(2): 140-151 (2005)
1990 – 1999
- 1998
- [j20]Ronald D. Armstrong, Wei Chen, Donald Goldfarb, Zhiying Jin:
Strongly polynomial dual simplex methods for the maximum flow problem. Math. Program. 80: 17-33 (1998) - 1997
- [j19]Ronald D. Armstrong, Zhiying Jin:
A new strongly polynomial dual network simplex algorithm. Math. Program. 77: 131-148 (1997) - 1996
- [j18]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. Comput. Oper. Res. 23(2): 171-182 (1996) - [j17]Ronald D. Armstrong, Zhiying Jin:
Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing. Discret. Appl. Math. 64(2): 97-103 (1996) - 1993
- [j16]Michael G. Sklar, Ronald D. Armstrong:
Lagrangian approach for large-scale least absolute value estimation. Comput. Oper. Res. 20(1): 83-93 (1993) - 1992
- [j15]Ronald D. Armstrong, Zhiying Jin:
Solving linear bottleneck assignment problems via strong spanning trees. Oper. Res. Lett. 12(3): 179-180 (1992) - 1990
- [j14]Timothy D. Fry, Ronald D. Armstrong, L. Drew Rosen:
Single machine scheduling to minimize mean absolute lateness: A heuristic solution. Comput. Oper. Res. 17(1): 105-112 (1990) - [j13]Michael G. Sklar, Ronald D. Armstrong, S. Samn:
Heuristics for Scheduling Aircraft and Crew during Airlift Operations. Transp. Sci. 24(1): 63-76 (1990)
1980 – 1989
- 1988
- [j12]Ronald D. Armstrong, Abraham Charnes, Cengiz Haksever:
Implementation of successive linear programming algorithms for non-convex goal programming. Comput. Oper. Res. 15(1): 37-49 (1988) - 1985
- [j11]Darwin D. Klingman, Ronald D. Armstrong, Parviz Partow-Navid:
Implementation and analysis of alternative algorithms for generalized shortest path problems. Comput. Oper. Res. 12(1): 39-49 (1985) - 1984
- [j10]Ronald D. Armstrong, Mabel Tam Kung:
A linked list data structure for a simple linear regression algorithm. Comput. Oper. Res. 11(3): 295-305 (1984) - [j9]Ronald D. Armstrong, Philip O. Beck, Mabel Tam Kung:
Algorithm 615: the best subset of parameters in leasst absolute value regression. ACM Trans. Math. Softw. 10(2): 202-206 (1984) - 1983
- [j8]Michael G. Sklar, Ronald D. Armstrong:
A linear programming algorithm for the simple model for discrete chebychev curve fitting. Comput. Oper. Res. 10(3): 237-248 (1983) - [j7]Ronald D. Armstrong, Philip O. Beck:
The best parameter subset using the Chebychev curve fitting criterion. Math. Program. 27(1): 64-74 (1983) - [j6]Ronald D. Armstrong, David S. Kung, Prabhakant Sinha, Andris A. Zoltners:
A computational study of a multiple-choice knapsack algorithm. ACM Trans. Math. Softw. 9(2): 184-198 (1983) - 1982
- [j5]Michael G. Sklar, Ronald D. Armstrong:
Least absolute value and chebychev estimation utilizing least squares results. Math. Program. 24(1): 346-352 (1982) - 1980
- [j4]Ronald D. Armstrong, David S. Kung:
A dual method for discrete Chebychev curve fitting. Math. Program. 19(1): 186-199 (1980)
1970 – 1979
- 1979
- [j3]Ronald D. Armstrong, Abraham Charnes, F. Phillips:
Page cuts for integer interval linear programming. Discret. Appl. Math. 1(1-2): 1-14 (1979) - 1978
- [c1]Ronald D. Armstrong, David S. Kung:
A dual method for discrete Chebychev curve fitting. ACM Annual Conference (2) 1978: 946-953 - 1975
- [j2]Ronald D. Armstrong, Joseph L. Balintfy:
A Chance Constrained Multiple Choice Programming Algorithm. Oper. Res. 23(3): 494-510 (1975) - 1974
- [j1]Ronald D. Armstrong, Prabhakant Sinha:
Improved penalty calculations for a mixed integer branch-and-bound algorithm. Math. Program. 6(1): 212-223 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
