Capacity factor or cycle time optimization for signalized junctions: A graph theory approach
- 1 February 1988
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 22 (1) , 1-23
- https://doi.org/10.1016/0191-2615(88)90031-8
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- A compact hash function for paths in PERT networksOperations Research Letters, 1984
- Control system design for an individual signalized junctionTransportation Research Part B: Methodological, 1984
- OptimalI-Intersection assignments for graphs: A linear programming approachNetworks, 1983
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- An Efficient Test for Circular-Arc GraphsSIAM Journal on Computing, 1980
- Capacity of a signalized road junction: Critique and extensionsTransportation Research, 1974
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- Estimating the traffic capacity of a signalized road junctionTransportation Research, 1972
- Delay-minimizing Settings for Fixed-time Traffic Signals at a Single Road JunctionIMA Journal of Applied Mathematics, 1971
- Scheduling of traffic lights—A new approachTransportation Research, 1968