Traffic Networks and Flows over Time

DOI10.1007/978-3-642-02094-0_9zbMath1248.90036OpenAlexW1563458049MaRDI QIDQ3637317

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

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)

Related Items (8)

Algorithms for Flows over Time with Scheduling Costs ⋮ 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 ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems ⋮ Algorithms for flows over time with scheduling costs

Uses Software

• DIMACS

Cites Work

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

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