✦ LIBER ✦

Complexity of Synchronized Flow and Related Problems for Basic Assumptions of Traffic Flow Theories

✍ Scribed by Boris S. Kerner

Book ID: 110303602
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 453 KB
Volume: 1
Category: Article
ISSN: 1566-113X
DOI: 10.1023/a:1011577010852

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A COMPARATIVE EVALUATION OF GRAVITY AND

A COMPARATIVE EVALUATION OF GRAVITY AND SYSTEM THEORY MODELS FOR STATEWIDE RECREATIONAL TRAFFIC FLOWS

✍ Jack B. Ellis; Carlton S. Van Doren 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 856 KB

On the characteristics of the equations

On the characteristics of the equations of motion for a bubbly flow and the related problem of critical flow

✍ A. Prosperetti; L. Van Wijngaarden 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 486 KB

A BRANCH-AND-BOUND/FLOW-EQUILIBRIUM ALGO

A BRANCH-AND-BOUND/FLOW-EQUILIBRIUM ALGORITHM FOR THE APPROXIMATE SOLUTION OF TOTAL COST MINIMIZATION PROBLEMS IN TRAFFIC NETWORKS

✍ Harry Böttcher; Werner Rothengatter; Bernd-Michael Sahling 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 762 KB

Traffic analysis: A stochastic study of

Traffic analysis: A stochastic study of the stopping point and its relation to traffic flow theory at controlled intersections. Currin, Thomas Raymond, Ph.D. The University of Connecticut, 1988. 183 pp.

📂 Article 📅 1989 🏛 Elsevier Science ⚖ 21 KB

A p-version finite element approach for

A p-version finite element approach for two- and three-dimensional problems of the J2 flow theory with non-linear isotropic hardening

✍ A. Düster; E. Rank 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 954 KB

## Abstract In this paper an implementation of a two‐ and three‐dimensional __p__‐version approach to the __J__~2~ flow theory with non‐linear isotropic hardening for small displacements and small strains is presented. Based on higher‐order quadrilateral and hexahedral element formulations, a Newto

Balanced network flows. VIII. A revised

Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views