default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoger L. Tobin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j18]J. David Allen, Roger L. Tobin, Anthony Calderan:
Verizon Optimizes Work Center Locations to Reduce Installation and Repair Operations Costs. Interfaces 47(2): 111-121 (2017)- 2013
- [c1]Roger L. Tobin:
Cost optimization in an FTTP environment. OFC/NFOEC 2013: 1-3
2000 – 2009
- 2002
- [j17]Roger L. Tobin:
Relief period optimization under budget constraints. Eur. J. Oper. Res. 139(1): 42-61 (2002)
1990 – 1999
- 1999
- [j16]Roger L. Tobin:
A fast interactive solution method for large capital expenditure selection problems. Eur. J. Oper. Res. 116(1): 1-15 (1999) - 1998
- [j15]Byung-Wook Wie, Roger L. Tobin:
On the relationship between dynamic Nash and instantaneous user equilibria. Networks 32(2): 141-163 (1998) - 1995
- [j14]Byung-Wook Wie, Roger L. Tobin, Terry L. Friesz, David Bernstein:
A Discrete Time, Nested Cost Operator Approach to the Dynamic Network User Equilibrium Problem. Transp. Sci. 29(1): 79-92 (1995) - 1994
- [j13]Terry L. Friesz
, David Bernstein, Nihal J. Mehta, Roger L. Tobin, Saiid Ganjalizadeh:
Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems. Oper. Res. 42(6): 1120-1136 (1994) - [j12]Byung-Wook Wie, Roger L. Tobin, Terry L. Friesz:
The Augmented Lagrangian Method for Solving Dynamic Network Traffic Assignment Models in Discrete Time. Transp. Sci. 28(3): 204-220 (1994) - 1993
- [j11]Roger L. Tobin:
A method for the analysis of equilibrium multipart prices in oligopolistic markets. Ann. Oper. Res. 44(2): 195-226 (1993) - [j10]Terry L. Friesz, David Bernstein, Tony E. Smith, Roger L. Tobin, Byung-Wook Wie:
A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem. Oper. Res. 41(1): 179-191 (1993) - [j9]Roger L. Tobin, Terry L. Friesz, Nihal J. Mehta:
K-K-T multiploer estimates and objective function lower bounds from projective SUMT. Oper. Res. Lett. 13(5): 305-313 (1993) - 1992
- [j8]Roger L. Tobin:
Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria. Ann. Oper. Res. 34: 21-36 (1992) - [j7]Tan Miller, Terry L. Friesz, Roger L. Tobin:
Heuristic algorithms for delivered price spatially competitive network facility location problems. Ann. Oper. Res. 34: 177-202 (1992) - [j6]Terry L. Friesz, Hsun-Jung Cho, Nihal J. Mehta, Roger L. Tobin, G. Anandalingam:
A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints. Transp. Sci. 26(1): 18-26 (1992) - 1990
- [j5]Terry L. Friesz, Roger L. Tobin, Hsun-Jung Cho, Nihal J. Mehta:
Sensitivity Analysis Based Heuristic Algorithms for Mathematical Programs with Variational Inequality Constraints. Math. Program. 48: 265-284 (1990)
1980 – 1989
- 1989
- [j4]Terry L. Friesz, Javier Luque, Roger L. Tobin, Byung-Wook Wie:
Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem. Oper. Res. 37(6): 893-901 (1989) - 1988
- [j3]Roger L. Tobin:
A variable dimension solution approach for the general spatial price equilibrium problem. Math. Program. 40(1-3): 33-51 (1988) - [j2]Roger L. Tobin, Terry L. Friesz:
Sensitivity Analysis for Equilibrium Network Flow. Transp. Sci. 22(4): 242-250 (1988) - 1987
- [j1]Chaisak Suwansirikul, Terry L. Friesz, Roger L. Tobin:
Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem. Transp. Sci. 21(4): 254-263 (1987)
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:23 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:
