Modular circulation and applications to traffic management
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Recommendations
- Modular circulation and applications to traffic management
- Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
- New algorithms for generalized network flows
- Minimization of travel time and weighted number of stops in a traffic-light network
- Minimum Convex Cost Dynamic Network Flows
Cites work
- A polynomial time primal network simplex algorithm for minimum cost flows
- Finding minimum-cost circulations by canceling negative cycles
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Introduction to algorithms
- Matching, Euler tours and the Chinese postman
- Network flows. Theory, algorithms, and applications.
- On the complexity of an unregulated traffic crossing
- Planar Formulae and Their Uses
- Scheduling autonomous vehicle platoons through an unregulated intersection
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(2)
This page was built for publication: Modular circulation and applications to traffic management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919619)
