default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard J. Caron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j14]Mohammadreza Safi, Seyed Saeed Nabavi, Richard J. Caron
:
A modified simplex partition algorithm to test copositivity. J. Glob. Optim. 81(3): 645-658 (2021)- 2020
- [j13]Maryam Mojalal, David A. Stanford, Richard J. Caron:
The lower-class waiting time distribution in the delayed accumulating priority queue. INFOR Inf. Syst. Oper. Res. 58(1): 60-86 (2020) - 2019
- [j12]Na Li, David A. Stanford, Azaz B. Sharif, Richard J. Caron, Alim Pardhan:
Optimising key performance indicator adherence with application to emergency department congestion. Eur. J. Oper. Res. 272(1): 313-323 (2019) - 2015
- [j11]Sahand Ashtab, Richard J. Caron, Esaignani Selvarajah:
A Characterization of Alternate Optimal Solutions for a Supply Chain Network Design Model. INFOR Inf. Syst. Oper. Res. 53(2): 90-93 (2015) - 2010
- [j10]Kevin Durda, Richard J. Caron, Lori Buchanan:
An Application of Operational Research to Computational Linguistics: Word Ambiguity. INFOR Inf. Syst. Oper. Res. 48(1): 1-11 (2010) - [j9]Richard J. Caron, Tim Traynor, Shafiu Jibrin:
Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities. INFORMS J. Comput. 22(1): 144-153 (2010) - 2002
- [j8]Richard J. Caron, Harvey J. Greenberg, Allen G. Holder:
Analytic centers and repelling inequalities. Eur. J. Oper. Res. 143(2): 268-290 (2002) - 2000
- [j7]Allen G. Holder, Richard J. Caron:
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights. Oper. Res. Lett. 26(2): 49-54 (2000) - 1995
- [j6]Wieslawa T. Obuchowska, Richard J. Caron:
Minimal representation of quadratically constrained convex feasible regions. Math. Program. 68: 169-186 (1995) - 1993
- [j5]Arnon Boneh, Shahar Boneh, Richard J. Caron:
Constraint classification in mathematical programming. Math. Program. 61: 61-73 (1993) - 1992
- [j4]Richard J. Caron, Myron Hlynka, J. Fred McDonald:
On the best case performance of hit and run methods for detecting necessary constraints. Math. Program. 54: 233-249 (1992) - 1991
- [j3]C. G. E. Boender, Richard J. Caron, J. Fred McDonald, A. H. G. Rinnooy Kan, H. Edwin Romeijn, Robert L. Smith, Jan Telgen, A. C. F. Vorst:
Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra. Oper. Res. 39(6): 945-954 (1991) - 1989
- [j2]Richard J. Caron, J. Fred McDonald:
A new approach to the analysis of random methods for detecting necessary linear inequality constraints. Math. Program. 43(1-3): 97-102 (1989) - 1983
- [j1]Michael J. Best, Richard J. Caron:
A method to increase the computational efficiency of certain quadratic programming algorithms. Math. Program. 25(3): 354-358 (1983)
Conference and Workshop Papers
- 2014
- [c1]Yifeng Li, Richard J. Caron, Alioune Ngom:
A decomposition method for large-scale sparse coding in representation learning. IJCNN 2014: 3732-3738
Reference Works
- 2009
- [r1]Richard J. Caron:
Redundancy in Nonlinear Programs. Encyclopedia of Optimization 2009: 3261-3263
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-24 22:48 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:
