In modern day automobile traffic the problem of traffic congestion calls for the design of efficient control strategies. In this paper it is argued that in order to have efficient and systematic solutions to a traffic control problem at an intersection, graph theoretic models of the problem are quite appropriate for its exploitation. Connectivity of compatibility graph of a traffic intersection...

Two-lattice polyhedra are a special class of lattice polyhedra that include network 4ow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polymatroids, etc. In this paper we show that the maximum sum of components of a vector in a 2-lattice polyhedron is equal to the minimum capacity of a cover for the polyhedron. For special classes of 2-lattice ...

In this paper, we introduce a new concept of volumes difference function of the projection and intersection bodies. Following this, we establish the Minkowski and Brunn-Minkowski inequalities for volumes difference function of the projection and intersection bodies.

Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; [14, 16]) are closed under intersection with regular tree languages [4, 5]. Using a variation of a proof technique devised by Thatcher [17], I show that even though closure under intersection does not obtain, it holds for every MG and regular tree language that their intersection is identic...

In order to reduce the traffic congestion and to enhance the capacity of urban road intersections, this paper builds a model of the vehicle queuing system for the intersection by queuing theory Based on Monte Carlo algorithm, this paper carries out simulation and analysis of the vehicle queuing system in the intersection by MATLAB, analyses, the status of vehicle queue to reduce the vehicle que...

Results of research on roundabouts in the United States are presented in the NCHRP Report 572. The findings and recommendations of this report are important as they will be the basis of the 2010 Highway Capacity Manual methodology for operational analysis of roundabouts. This paper discusses various findings and recommendations of the NCHRP Report 572 on roundabout capacity and level of service...

We study the convex hull of the splittable flow arc set with capacity and minimum load constraints. This set arises as a relaxation of problems where clients have demand for a resource that can be installed in integer amounts and that has capacity limitations and lower bounds on utilization. We prove that the convex hull of this set is the intersection of the convex hull of the set with a capac...

of a thesis at the University of Miami. Thesis supervised by Associate Professor Dilip Sarkar. No. of pages in text. (37) A GPS system selects routes between two points with minimum physical distance or minimum driving time. Here we address a different type of route selection problem. Given a road map with driving distance and wireless connectivity for each road segment, find a driving route th...

This paper explores the fundamental properties of distributed minimization of a sum of functions with each function only known to one node, and a pre-specified level of node knowledge and computational capacity. We define the optimization information each node receives from its objective function, the neighboring information each node receives from its neighbors, and the computational capacity ...

As a common generalization of matchings and matroid intersection, W.H. Cunningham and J.F. Geelen introduced the notion of path-matchings, then they introduced the more general notion of even factor in weakly symmetric digraphs. Here we give a min-max formula for the maximum cardinality of an even factor. Our proof is purely combinatorial. We also provide a Gallai-Edmonds-type structure theorem...