A flow algorithm for network synchronization.

Auteur(s)
Hassin, R.
Jaar
Samenvatting

The problem we treat is defined on a graph where each node is associated with a variable and ther are loss functions defined on the arcs, depending on the difference between the corresponding node variables. The objective is to compute values for the node variables so as to minimize the sum of losses. We exploit the relation between this problem and network flows optimization and use it in developing an approximation algorithm for the problem. A main application of the problem is the synchronization of fixed cycle traffic signals. (A)

Publicatie aanvragen

4 + 10 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
970661 ST [electronic version only]
Uitgave

Operations Research, Vol. 44 (1996), No. 4 (July-August), p. 570-579, 26 ref.

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.