Adjacent extreme flows and application to min concave cost flow problems

1 June 1979

journal article
research article
Published by Wiley in Networks

Vol. 9 (2) , 95-121
https://doi.org/10.1002/net.3230090202

Abstract

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.

Keywords

This publication has 9 references indexed in Scilit:

Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
Networks, 1975
On building minimum cost communication networks over time
Networks, 1974
Concave minimization over a convex polyhedron
Naval Research Logistics Quarterly, 1973
On building minimum cost communication networks
Networks, 1973
Minimum cost routing for static network models
Networks, 1971
Solving the Fixed Charge Problem by Ranking the Extreme Points
Operations Research, 1968
Minimum Concave Cost Flows in Certain Networks
Management Science, 1968
Networks and Basic Solutions
Operations Research, 1966
Linear Programming and Extensions
Published by Walter de Gruyter GmbH ,1963