default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTerry L. Friesz
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j21]Ke Han
, Terry L. Friesz, Tao Yao:
A Variational Approach for Continuous Supply Chain Networks. SIAM J. Control. Optim. 52(1): 663-686 (2014)- [j20]Sung Hoon Chung, Terry L. Friesz, Robert D. Weaver:
Dynamic Sustainability Games for Renewable Resources-A Computational Approach. IEEE Trans. Computers 63(1): 155-166 (2014) - 2013
- [j19]Sung Hoon Chung, Robert D. Weaver, Terry L. Friesz:
Strategic response to pollution taxes in supply chain networks: Dynamic, spatial, and organizational dimensions. Eur. J. Oper. Res. 231(2): 314-327 (2013) - [j18]Lifan Fan, Terry L. Friesz, Tao Yao, Xu Chen:
Strategic Pricing and Production Planning Using a Stackelberg Differential Game With Unknown Demand Parameters. IEEE Trans. Engineering Management 60(3): 581-591 (2013) - [c4]Benedetto Piccoli, Ke Han, Terry L. Friesz, Tao Yao:
Estimating fuel consumption and emissions via traffic data from mobile sensors. Allerton 2013: 472-477 - [c3]Shaun Lichter, Terry L. Friesz, Christopher Griffin:
Impact of a Non-linear Pay-Off Function on Pairwise Stable Collaborative Oligopolies. SocialCom 2013: 750-755 - 2012
- [j17]Byung Do Chung, Jiahan Li, Tao Yao, Changhyun Kwon, Terry L. Friesz:
Demand Learning and Dynamic Pricing under Competition in a State-Space Framework. IEEE Trans. Engineering Management 59(2): 240-249 (2012) - [i5]Terry L. Friesz, Changhyun Kwon, Tae Il Kim, Lifan Fan, Tao Yao:
Competitive Robust Dynamic Pricing in Continuous Time with Fixed Inventories. CoRR abs/1208.4374 (2012) - 2011
- [c2]Terry L. Friesz, Pedro A. Neto, Amir H. Meimand:
Fixed point methods for computing within-day dynamic user equilibrium. ITSC 2011: 2093-2097 - [c1]Shaun Lichter, Terry L. Friesz, Christopher Griffin:
Link Bias in Network Formation Games. SocialCom/PASSAT 2011: 684-687 - [i4]Shaun Lichter, Christopher Griffin, Terry L. Friesz:
A Game Theoretic Perspective on Network Topologies. CoRR abs/1106.2440 (2011) - [i3]Shaun Lichter, Christopher Griffin, Terry L. Friesz:
Link Biased Strategies in Network Formation Games. CoRR abs/1106.3582 (2011) - [i2]Shaun Lichter, Terry L. Friesz, Christopher Griffin:
Collaborative Network Formation in Spatial Oligopolies. CoRR abs/1108.4114 (2011) - [i1]Shaun Lichter, Christopher Griffin, Terry L. Friesz:
Calculating the Price of Anarchy for Network Formation Games. CoRR abs/1108.4115 (2011)
2000 – 2009
- 2009
- [j16]Changhyun Kwon, Terry L. Friesz, Reetabrata Mookherjee, Tao Yao, Baichun Feng:
Non-cooperative competition among revenue maximizing service providers with demand learning. Eur. J. Oper. Res. 197(3): 981-996 (2009) - 2008
- [j15]Changhyun Kwon, Terry L. Friesz:
Valuation of American options by the gradient projection method. Appl. Math. Comput. 206(1): 380-388 (2008)
1990 – 1999
- 1996
- [j14]Terry L. Friesz, David Bernstein, Roger Stough:
Dynamic Systems, Variational Inequalities and Control Theoretic Models for Predicting Time-Varying Urban Network Flows. Transp. Sci. 30(1): 14-31 (1996) - 1995
- [j13]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
- [j12]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) - [j11]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
- [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]Gnana Anandalingam, Terry L. Friesz:
Hierarchical optimization: An introduction. Ann. Oper. Res. 34: 1-11 (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, Terry L. Friesz:
Sensitivity Analysis for Equilibrium Network Flow. Transp. Sci. 22(4): 242-250 (1988) - 1987
- [j2]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) - 1986
- [j1]Terry L. Friesz, Joel A. Gottfried, Edward K. Morlok:
A Sequential Shipper-Carrier Network Model for Predicting Freight Flows. Transp. Sci. 20(2): 80-91 (1986)
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-09 21:29 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:
