We present a model for asynchronous distributed computation and then proceed to analyze
the convergence of natural asynchronous distributed versions of a large class of …

The analysis of transportation phenomena by quantitative approaches naturally gives rise to
network models that represent the spatial characteristics of the transport infrastructure. This …

Because of its imbedded network flow structure, the generic network design problem is an
attractive candidate for integer programming decomposition. This paper studies the …

In an uncongested transportation network, adding routes and capacity to an existing network
must decrease, or at worst not change, the average time individuals require to travel through …

We propose a class of algorithms for finding an optimal quasi-static routing in a
communication network. The algorithms are based on Gallager's method [1] and provide …

In this paper we study the performance of a class of distributed optimal routing algorithms of
the gradient projection type under weaker and more realistic assumptions than those …

The purpose of this paper is to provide a unified description of iterative algorithms for the
solution of traffic equilibrium problems. We demonstrate that a large number of well known …

A gradient-projection algorithm using iterative aggregation and disaggregation is proposed
and analyzed for box-constrained minimization problems. In a distributed computation …

We consider a model of distributed iterative algorithms whereby several processors
participate in the computation while collecting, possibly stochastic information from the …

In this paper, we derive a time-complexity bound for the gradient projection method for
optimal routing in data networks. This result shows that the gradient projection algorithm of …