Search results

...Capacity: Impacts of Truck Lane Restrictions.|author=Laval, Jorge |journal=Transportation Research Part B: Methodological|volume= 43|issue=6 |pages=720–728 |year=200 According to Newell's moving bottleneck theory, we have: ...

...article shows how '''Newell's method''' fits in the context of variational theory. == Basic principles of variational theory (VT) == ...

...hematical optimization]], the '''network simplex algorithm''' is a [[graph theory|graph theoretic]] specialization of the [[simplex algorithm]]. The algorith ...network simplex algorithm was one of the major open problems in complexity theory, even though efficient-in-practice versions were available. In 1995 [[James ...

...raphs with the same number of vertices. It ranges from 0 for [[Tree (graph theory)|trees]] to 1 for [[maximal planar graph]]s.<ref name=first> ...ph to two extreme relevant references. In one end, there are [[Tree (graph theory)|trees]], planar graphs with no cycle.<ref name="first"/> The other extreme ...

...ficiencies of both the '''[[Monte Carlo method]]''' and the '''[[diffusion theory]]''' for photon transport to model photons traveling through tissue both ac == MCML (Monte Carlo Modeling of Light Transportation in Multi-Layered Medium) == ...

...orovich mass transference problem and its stochastic applications |journal=Theory of Probability & Its Applications |date=1985 |volume=29 |issue=4 |pages=647 ...illani">{{cite book |last1=Villani |first1=Cédric |title=Topics in optimal transportation |date=2003 |publisher=American Mathematical Society}}</ref> ...

| thesis_title = Optimal transportation and action-minimizing measures | thesis_url = https://people.math.ethz.ch/~afigalli/education-pdf/Optimal-transportation-and-action-minimizing-measures.pdf ...

...oute capacity is highly dependent on [[headway]]. Beyond this mathematical theory, capacity may be influenced by other factors such as slow zones, single-tra ...d_alameda_factsheet.asp |title=Alameda Fact Sheet |author=Alameda Corridor Transportation Authority |accessdate=February 11, 2016}}</ref> which is high in comparison ...

...their effect on [[network theory|network usage]], whether the network is a transportation, communication or some other type of network. ...

...easure in many areas of mathematical science and social sciences. In graph theory, two vertices are said to be connected if there is a path between them. In ...ct, partial relations have been studied in other aspects. [[Random graph]] theory allows one to assign a [[probability]] to each edge of a graph. This method ...

...7 |work = Using Multifidelity Methods to Estimate the Risk Associated with Transportation Systems}}</ref> ...588|last1=Schlicht|first1=Erik J|title=Estimating the risk associated with transportation technology using multifidelity simulation|last2=Morris|first2=Nichole L|cla ...

...ents and environmental emissions (including all the various manufacturing, transportation, mining and related requirements) required for producing a particular produ ==Theory== ...

...USA patent: US 6522970B2 (Filed: 2000)]</ref> Kerner's three-phase traffic theory and, respectively, the ASDA/FOTO models are based on some ''common'' spatio ...&pi=19 Boris S. Kerner, "Congested Traffic Flow: Observations and Theory", Transportation Research Record, Vol. 1678, pp. 160-167 (1999)] {{Webarchive|url=https://ar ...

...ssumed. The latent variable interpretation is also used in [[item response theory]] (IRT). ..., Multinomial probit with structured covariance for route choice behavior, Transportation Research Part B: Methodological, Volume 31, Issue 3, June 1997, Pages 195–2 ...

* [[Sturm–Liouville theory]] of [[orthogonal polynomials]] and separable partial differential equation ===Dynamical systems and Chaos theory=== ...

...nscious, non-renewable or renewable resources, location, labor conditions, transportation and wealth. Ecometrics is used in labeling programs such as the US EPA Fuel ##Transportation ...

...nce for [[weighted networks|unweighted networks]] is the [[Distance (graph theory)|length of a shortest path]] between a nodes <math>i</math> and <math>j</ma ...dge has unitary weight, <math>G^{\text{ideal}}</math> is a [[Clique (graph theory)|clique]], a full network, and <math>E(G^{\text{ideal}})= 1</math>. When th ...

...ographic research term|term used in social identity theory|Social identity theory#Individual mobility}} ...| first3 = V. | last4 = Stanley | first4 = H. E. | year = 2003 | title = A theory of power-law distributions in financial market fluctuations | journal = Nat ...

...y | first3=Mel | title=Strictly correlated electrons in density-functional theory | journal=[[Physical Review A]] | volume=59 | issue=1 | date=1999-01-01 | d of [[density functional theory]], alternative to the widely used [[Kohn-Sham equations|Kohn-Sham DFT]], es ...

...the highway dimension captures the properties of [[Public transport|public transportation]] networks well (at least according to definitions 1 and 2 below), given th ...a certain set of [[Shortest path problem|shortest paths]]: given a [[Graph theory|graph]] <math>G=(V,E)</math> with edge lengths <math>\ell:E\to\mathbb{R}^+< ...