Premium
Adjacent extreme flows and application to min concave cost flow problems
Author(s) -
Gallo G.,
Sodini C.
Publication year - 1979
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230090202
Subject(s) - extreme point , adjacency list , flow network , mathematical optimization , computer science , flow (mathematics) , set (abstract data type) , relevance (law) , extreme value theory , graph , point (geometry) , maximum flow problem , algorithm , mathematics , theoretical computer science , combinatorics , geometry , statistics , political science , law , programming language
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.