default search action
Carlos F. Daganzo
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i2]Carlos F. Daganzo:
An operating system for extra long urban trains. CoRR abs/2109.11619 (2021)
2010 – 2019
- 2018
- [i1]Carlos F. Daganzo:
Minuet: A method to solve Sudoku puzzles by hand. CoRR abs/1812.06778 (2018) - 2012
- [j30]Carlos F. Daganzo, Vikash V. Gayah, Eric J. Gonzales:
The potential of parsimonious models for understanding large scale transportation systems and answering big picture questions. EURO J. Transp. Logist. 1(1-2): 47-65 (2012)
2000 – 2009
- 2008
- [j29]Yanfeng Ouyang, Carlos F. Daganzo:
Robust tests for the bullwhip effect in supply chains with stochastic dynamics. Eur. J. Oper. Res. 185(1): 340-353 (2008) - 2007
- [j28]Karen R. Smilowitz, Carlos F. Daganzo:
Continuum approximation techniques for the design of integrated package distribution systems. Networks 50(3): 183-196 (2007) - 2006
- [j27]Carlos F. Daganzo, Karen R. Smilowitz:
A note on asymptotic formulae for one-dimensional network flow problems. Ann. Oper. Res. 144(1): 153-160 (2006) - [j26]Yanfeng Ouyang, Carlos F. Daganzo:
Characterization of the Bullwhip Effect in Linear, Time-Invariant Supply Chains: Some Formulae and Tests. Manag. Sci. 52(10): 1544-1556 (2006) - [j25]Carlos F. Daganzo:
On the variational theory of traffic flow: well-posedness, duality and applications. Networks Heterog. Media 1(4): 601-619 (2006) - [j24]Yanfeng Ouyang, Carlos F. Daganzo:
Discretization and Validation of the Continuum Approximation Scheme for Terminal System Design. Transp. Sci. 40(1): 89-98 (2006) - [j23]Anne V. Goodchild, Carlos F. Daganzo:
Double-Cycling Strategies for Container Ships and Their Effect on Ship Loading and Unloading Operations. Transp. Sci. 40(4): 473-483 (2006) - 2004
- [j22]Carlos F. Daganzo:
On the Stability of Supply Chains. Oper. Res. 52(6): 909-921 (2004) - [j21]Carlos F. Daganzo, Karen R. Smilowitz:
Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems. Transp. Sci. 38(3): 343-356 (2004) - 2003
- [j20]Juan Carlos Muñoz, Carlos F. Daganzo:
Structure of the Transition Zone Behind Freeway Queues. Transp. Sci. 37(3): 312-329 (2003) - 2002
- [j19]Alan L. Erera, Carlos F. Daganzo, David J. Lovell:
The Access-Control Problem on Capacitated FIFO Networks With Unique O-D Paths is Hard. Oper. Res. 50(4): 736-743 (2002) - 2000
- [j18]Carlos F. Daganzo, Reinaldo Crispiniano Garcia:
A Pareto Improving Strategy for the Time-Dependent Morning Commute Problem. Transp. Sci. 34(3): 303-311 (2000)
1990 – 1999
- 1998
- [j17]Carlos F. Daganzo:
Queue Spillovers in Transportation Networks with a Route Choice. Transp. Sci. 32(1): 3-11 (1998) - 1995
- [j16]Carlos F. Daganzo, Esteban Diez-Roux:
The variance of the number of customers in an infinite-server queueing system with an arbitrarily correlated arrival process. Queueing Syst. Theory Appl. 19(3): 289-299 (1995) - 1993
- [j15]Carlos F. Daganzo, Randolph W. Hall:
A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary Items. Transp. Sci. 27(4): 315-329 (1993) - [j14]Carlos F. Daganzo, Michael Kusnic:
Technical Note - Two Properties of the Nested Logit Model. Transp. Sci. 27(4): 395-400 (1993) - 1990
- [j13]Carlos F. Daganzo:
Some Properties of Polling Systems. Queueing Syst. Theory Appl. 6(2): 137-154 (1990) - [j12]Carlos F. Daganzo:
The Productivity of Multipurpose Seaport Terminals. Transp. Sci. 24(3): 205-216 (1990)
1980 – 1989
- 1989
- [j11]Federico Sabria, Carlos F. Daganzo:
Approximate Expressions for Queueing Systems with Scheduled Arrivals and Established Service Order. Transp. Sci. 23(3): 159-165 (1989) - 1987
- [j10]Carlos F. Daganzo:
The Break-Bulk Role of Terminals in Many-to-Many Logistic Networks. Oper. Res. 35(4): 543-555 (1987) - [j9]Carlos F. Daganzo:
Increasing Model Precision Can Reduce Accuracy. Transp. Sci. 21(2): 100-105 (1987) - [j8]Carlos F. Daganzo:
Modeling Distribution Problems with Time Windows: Part I. Transp. Sci. 21(3): 171-179 (1987) - [j7]Carlos F. Daganzo:
Modeling Distribution Problems with Time Windows. Part II: Two Customer Types. Transp. Sci. 21(3): 180-187 (1987) - 1986
- [j6]Carlos F. Daganzo, Gordon F. Newell:
Configuration of physical distribution networks. Networks 16(2): 113-132 (1986) - [j5]Abraham D. Horowitz, Carlos F. Daganzo:
Extrapolating Automobile Usage Data to Long Time Periods. Transp. Sci. 20(1): 48-51 (1986) - [j4]Carlos F. Daganzo:
Static Blocking at Railyards: Sorting Implications and Track Requirements. Transp. Sci. 20(3): 189-199 (1986) - [c1]Lawrence D. Burns, Carlos F. Daganzo:
Assembly line job sequencing principles. ICRA 1986: 1482 - 1985
- [j3]Lawrence D. Burns, Randolph W. Hall, Dennis E. Blumenfeld, Carlos F. Daganzo:
Distribution Strategies that Minimize Transportation and Inventory Costs. Oper. Res. 33(3): 469-490 (1985) - [j2]Carlos F. Daganzo:
The Uniqueness of a Time-dependent Equilibrium Distribution of Arrivals at a Single Bottleneck. Transp. Sci. 19(1): 29-37 (1985) - 1984
- [j1]Carlos F. Daganzo:
The Distance Traveled to Visit N Points with a Maximum of C Stops per Vehicle: An Analytic Model and an Application. Transp. Sci. 18(4): 331-350 (1984)
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-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint