default search action
Richard M. Soland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j15]Mohammad S. Sabbagh, Richard M. Soland:
An improved partial enumeration algorithm for integer programming problems. Ann. Oper. Res. 166(1): 147-161 (2009)
1990 – 1999
- 1993
- [j14]Donald Gross, Bingchang Gu, Richard M. Soland:
Iterative solution methods for obtaining the steady-state probability distributions of Markovian multi-echelon repairable item inventory systems. Comput. Oper. Res. 20(8): 817-828 (1993)
1980 – 1989
- 1987
- [j13]Richard M. Soland:
Optimal Terminal Defense Tactics When Several Sequential Engagements are Possible. Oper. Res. 35(4): 537-542 (1987) - 1981
- [j12]John W. Hultz, Darwin D. Klingman, G. Terry Ross, Richard M. Soland:
An interactive computer system for multicriteria facility location. Comput. Oper. Res. 8(4): 249-261 (1981)
1970 – 1979
- 1976
- [j11]Johnnie R. Charnetski, Richard M. Soland:
Technical Note - Statistical Measures for Linear Functions on Polytopes. Oper. Res. 24(1): 201-204 (1976) - 1975
- [j10]G. Terry Ross, Richard M. Soland:
A branch and bound algorithm for the generalized assignment problem. Math. Program. 8(1): 91-103 (1975) - 1974
- [j9]Richard M. Soland:
Optimal Facility Location with Concave Costs. Oper. Res. 22(2): 373-382 (1974) - 1973
- [j8]Charles E. Pinkus, Donald Gross, Richard M. Soland:
Optimal Design of Multiactivity Multifacility Systems by Branch and Bound. Oper. Res. 21(1): 270-283 (1973) - [j7]Richard M. Soland:
Optimal Defensive Missile Allocation: A Discrete Min-Max Problem. Oper. Res. 21(2): 590-596 (1973) - 1972
- [j6]Robert E. Kuenne, Richard M. Soland:
Exact and approximate solutions to the multisource weber problem. Math. Program. 3(1): 193-209 (1972) - 1971
- [j5]Frederic A. Miercort, Richard M. Soland:
Optimal Allocation of Missiles Against Area and Point Defenses. Oper. Res. 19(3): 605-617 (1971)
1960 – 1969
- 1969
- [j4]Richard M. Soland:
Letter to the Editor - Availability of Renewal Functions for Gamma and Weibull Distributions with Increasing Hazard Rate. Oper. Res. 17(3): 536-543 (1969) - 1968
- [j3]Richard M. Soland:
A Renewal Theoretic Approach to the Estimation of Future Demand for Replacement Parts. Oper. Res. 16(1): 36-51 (1968) - 1967
- [j2]Lewis T. Reinwald, Richard M. Soland:
Conversion of Limited-Entry Decision Tables to Optimal Computer Programs II: minimum storage requirement. J. ACM 14(4): 742-756 (1967) - 1966
- [j1]Lewis T. Reinwald, Richard M. Soland:
Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time. J. ACM 13(3): 339-358 (1966)
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:49 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: