default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn R. Current
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j15]Luís Santos, João Manuel Coutinho-Rodrigues
, John R. Current:
An improved heuristic for the capacitated arc routing problem. Comput. Oper. Res. 36(9): 2632-2637 (2009)- 2008
- [j14]M.-G. Yoon, John R. Current:
The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic. J. Oper. Res. Soc. 59(1): 80-89 (2008) - 2007
- [j13]Akio Imai, Etsuko Nishimura, John R. Current:
A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur. J. Oper. Res. 176(1): 87-105 (2007) - 2002
- [j12]James W. George, Charles S. Revelle, John R. Current:
The Maximum Utilization Subtree Problem. Ann. Oper. Res. 110(1-4): 133-151 (2002) - [j11]Horst A. Eiselt, John R. Current:
Special issue on location analysis. Comput. Oper. Res. 29(6) (2002)
1990 – 1999
- 1999
- [j10]João Manuel Coutinho-Rodrigues, João C. N. Clímaco, John R. Current:
An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput. Oper. Res. 26(8): 789-798 (1999) - 1998
- [j9]Charles A. Weber, John R. Current, Anand Desai:
Non-cooperative negotiation strategies for vendor selection. Eur. J. Oper. Res. 108(1): 208-223 (1998) - [j8]John R. Current, Samuel Ratick, Charles S. Revelle:
Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach. Eur. J. Oper. Res. 110(3): 597-609 (1998) - 1994
- [j7]John R. Current, Hasan Pirkul, Erik Rolland:
Efficient Algorithms for Solving the Shortest Covering Path Problem. Transp. Sci. 28(4): 317-327 (1994) - 1991
- [j6]Hasan Pirkul, John R. Current, Vaidyanathan Nagarajan:
The Hierarchical Network Design Problem: A New Formulation and Solution Procedures. Transp. Sci. 25(3): 175-182 (1991) - 1990
- [j5]John R. Current, Charles S. Revelle, Jared L. Cohon:
An interactive approach to identify the best compromise solution for two objective shortest path problems. Comput. Oper. Res. 17(2): 187-198 (1990)
1980 – 1989
- 1989
- [j4]John R. Current, David A. Schilling:
The Covering Salesman Problem. Transp. Sci. 23(3): 208-213 (1989) - 1988
- [j3]John R. Current:
The Design of a Hierarchical Transportation Network with Transshipment Facilities. Transp. Sci. 22(4): 270-277 (1988) - 1986
- [j2]John R. Current:
Discrete computational structures, second edition, By Robert R. Korfhage, Academic Press, Inc., Orlando, FI, 1984, 360 pp. Price $35.00. Networks 16(4): 444-445 (1986) - 1980
- [j1]Jared L. Cohon, Charles S. Revelle, John R. Current, Thomas Eagles, Russell C. Eberhart, Richard L. Church:
Application of a multiobjective facility location model to power plant siting in a six-state region of the U.S. Comput. Oper. Res. 7(1-2): 107-123 (1980)
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:52 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:
