Traffic Networks and Flows over Time

DOI10.1007/978-3-642-02094-0_9MaRDI QIDQ3637317zbMATH OpenOpenAlexFDO

Authors Ekkehard Köhler, Rolf H. Möhring, Martin Skutella

Publication date 9 July 2009

Published in Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02094-0_9

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Recommendations

• scientific article; zbMATH DE number 2223065
• scientific article; zbMATH DE number 5130020
• A Dynamic Space-Time Network Flow Model for City Traffic Congestion
• Improving traffic flows at no cost
• scientific article; zbMATH DE number 1614663

Cites work

• A survey of dynamic network flows
• Algorithms – ESA 2005
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem
• An FPTAS for quickest multicommodity flows with inflow-dependent transit times
• An FPTAS for quickest multicommodity flows with inflow-dependent transit times
• An introduction to network flows over time
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Approximating earliest arrival flows with flow-dependent transit times
• Combinatorial Optimization with Rational Objective Functions
• Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
• Efficiency and fairness of system-optimal routing with user constraints
• Efficient continuous-time dynamic network flow algorithms
• Experimental and Efficient Algorithms
• Experimental and Efficient Algorithms
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• Faster algorithms for the quickest transshipment problem
• Flows over Time with Load-Dependent Transit Times
• How bad is selfish routing?
• scientific article; zbMATH DE number 1003275 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 5734722 (Why is no real title available?)
• scientific article; zbMATH DE number 5772890 (Why is no real title available?)
• scientific article; zbMATH DE number 1024734 (Why is no real title available?)
• scientific article; zbMATH DE number 1947425 (Why is no real title available?)
• scientific article; zbMATH DE number 2079322 (Why is no real title available?)
• scientific article; zbMATH DE number 2086912 (Why is no real title available?)
• scientific article; zbMATH DE number 1867317 (Why is no real title available?)
• scientific article; zbMATH DE number 2119659 (Why is no real title available?)
• scientific article; zbMATH DE number 2119661 (Why is no real title available?)
• scientific article; zbMATH DE number 3359947 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• scientific article; zbMATH DE number 2223065 (Why is no real title available?)
• Maximal Flow Through a Network
• Maximal, Lexicographic, and Dynamic Network Flows
• Multicommodity flows over time: Efficient algorithms and complexity
• Network flows. Theory, algorithms, and applications.
• Note—Some Equivalent Objectives for Dynamic Network Flow Problems
• On the history of the transportation and maximum flow problems
• On the use of lexicographic min cost flows in evacuation modeling
• Optimal dynamic routing in communication networks with continuous traffic
• Optimal Time-Varying Flows on Congested Networks
• Quickest Flows Over Time
• Selfish Routing in Capacitated Networks
• Shortest chain subject to side constraints
• Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• The Distribution of a Product from Several Sources to Numerous Localities
• The quickest flow problem
• The quickest transshipment problem
• Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods
• Transient flows in networks
• Über ein Paradoxon aus der Verkehrsplanung

Cited in

(19)

• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• The complexity of routing with collision avoidance
• A tight bound on the speed-up through storage for quickest multi-commodity flows
• Algorithms for flows over time with scheduling costs
• A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
• Infrastructure investment and travel time
• Source-destination flow on a road network
• A survey on models and algorithms for discrete evacuation planning network problems
• scientific article; zbMATH DE number 1614663 (Why is no real title available?)
• Simulation of the autobahn traffic in North Rhine-Westphalia
• scientific article; zbMATH DE number 5130020 (Why is no real title available?)
• scientific article; zbMATH DE number 1947425 (Why is no real title available?)
• scientific article; zbMATH DE number 2106176 (Why is no real title available?)
• Algorithms for Flows over Time with Scheduling Costs
• Traffic dynamics on coupled spatial networks
• Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems
• Evolutionary traffic flow landscapes: a fitness approach for ITS management
• scientific article; zbMATH DE number 2223065 (Why is no real title available?)
• Modeling and optimization of scalar flows on networks

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Traffic Networks and Flows over Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637317)