Istituto di Scienza e Tecnologie dell'Informazione     
Gallo G., Sodini C. Adjacent extreme flows and applications to min concave cost flow problems. In: Networks, vol. 9 pp. 95 - 121. 1979.
In this paper an algorithm is presented which, given an extreme flow on a Network, enumerates all its neighboring extreme flows. The algorithm is based on a graph theoretic characterization of the adjacency relationship. The relevance of finding the set of extreme flows adjacent to a given one is discussed from the point of view of concave optimization on Networks.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional