default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames R. Evans
Person information
- affiliation: University of Cincinnati, Lindner College of Business, Cincinnati, Ohio, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Karishma D'sa, James R. Evans, Gurvir S. Virdi
, Giulia Vecchi, Alexander Adam, Ottavia Bertolli, James Fleming, Hojong Chang, Craig Leighton, Mathew H. Horrocks, Dilan Athauda, Minee L. Choi, Sonia Gandhi:
Prediction of mechanistic subtypes of Parkinson's using patient-derived stem cell models. Nat. Mac. Intell. 5(8): 933-946 (2023)
2010 – 2019
- 2015
- [j20]James R. Evans:
Teaching Note - Analytic Visualization of Solver Output. INFORMS Trans. Educ. 15(3): 232-239 (2015)
2000 – 2009
- 2008
- [j19]James R. Evans:
Teaching Note - Some Practical Issues with Excel Solver: Lessons for Students and Instructors. INFORMS Trans. Educ. 8(2): 89-95 (2008) - 2004
- [j18]R. Ramabadran, James W. Dean Jr., James R. Evans, Amitabh S. Raturi:
Testing the relationship between team and partner characteristics and cooperative benchmarking outcomes. IEEE Trans. Engineering Management 51(2): 208-225 (2004)
1990 – 1999
- 1998
- [j17]Shigeru Tsubakitani, James R. Evans:
Optimizing tabu list size for the traveling salesman problem. Comput. Oper. Res. 25(2): 91-97 (1998) - 1995
- [j16]Adam Fadlalla, James R. Evans:
Improving the performance of enumerative search methods-I. Exploiting structure and intelligence. Comput. Oper. Res. 22(6): 605-613 (1995) - [j15]Adam Fadlalla, James R. Evans, Martin S. Levy:
Improving the performance of enumerative search methods - part II: Computational experiments. Comput. Oper. Res. 22(10): 987-994 (1995) - 1994
- [j14]Adam Fadlalla, James R. Evans, Martin S. Levy:
A greedy heuristic for the mean tardiness sequencing problem. Comput. Oper. Res. 21(3): 329-336 (1994) - 1992
- [b1]James R. Evans, Edward Minieka:
Optimization algorithms for networks and graphs (2. ed.). Dekker 1992, ISBN 978-0-8247-8602-1, pp. I-X, 1-470 - 1991
- [j13]David F. Rogers, Robert D. Plante, Richard T. Wong, James R. Evans:
Aggregation and Disaggregation Techniques and Methodology in Optimization. Oper. Res. 39(4): 553-582 (1991)
1980 – 1989
- 1989
- [j12]Charles E. Wells, James R. Evans:
Statistical procedures for estimating branch flows and total network flow. Networks 19(4): 481-491 (1989) - 1987
- [j11]James R. Evans:
Structural analysis of local search heuristics in combinatorial optimization. Comput. Oper. Res. 14(6): 465-477 (1987) - 1983
- [j10]James R. Evans:
A network decomposition/aggregation procedure for a class of multicommodity transportation problems. Networks 13(2): 197-205 (1983) - 1980
- [j9]James R. Evans:
Reducing computational effort in detecting integral multicommodity networks. Comput. Oper. Res. 7(4): 261-265 (1980)
1970 – 1979
- 1979
- [j8]James R. Evans:
Aggregation in the generalized transportation problem. Comput. Oper. Res. 6(4): 199-204 (1979) - 1978
- [j7]James R. Evans:
Technical Note - A Single-Commodity Transformation for Certain Multicommodity Networks. Oper. Res. 26(4): 673-680 (1978) - [j6]James R. Evans:
On equivalent representations of certain multicommodity networks as single commodity flow problems. Math. Program. 15(1): 92-99 (1978) - [j5]James R. Evans, John J. Jarvis:
Network topology and integral multicommodity flow problems. Networks 8(2): 107-119 (1978) - 1977
- [j4]James R. Evans, John J. Jarvis:
An out-of-kilter based heuristic for the integer multicommodity transportation problem. Comput. Oper. Res. 4(1): 13-20 (1977) - [j3]James R. Evans, John J. Jarvis, Richard A. Duke:
Graphic matroids and the multicommodity transportation problem. Math. Program. 13(1): 323-328 (1977) - 1976
- [j2]James R. Evans:
A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem. Math. Program. 10(1): 401-404 (1976) - [j1]James R. Evans:
Maximum flow in probabilistic graphs-the discrete case. Networks 6(2): 161-183 (1976)
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-10-07 22:16 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:
