Abstract
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network simplex algorithms for the standard and for the generalized minimum cost flow problems, most of the computations performed at each pivot operation have direct hypergraph interpretations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ, 1993).
G. Ausiello, A. D’Atri and D. Saccà, Graph algorithms for functional dependency manipulation,Journal of ACM 30 (1983) 752–766.
R. Cambini, G. Gallo and M.G. Scutellà, Minimum cost flows on hypergraphs, Technical Report TR-1/92, Dipartimento di Informatica, University of Pisa, Pisa, 1992.
G. Gallo, F. Licheri and M.G. Scutellà, The hypergraph simplex approach: Some experimental results,Ricerca Operativa ANNO XXVI, 78 (1996) 21–54.
G. Gallo, G. Longo, S. Nguyen and S. Pallottino, Directed hypergraphs and applications,Discrete Applied Mathematics 42 (1993) 177–201.
G. Gallo and G. Rago, A hypergraph approach to logical inference for datalog formulae, Technical Report TR-28/90, Dipartimento di Informatica, University of Pisa, Pisa, 1990.
R.G. Jeroslow, R.K. Martin, R.R. Rardin and J. Wang, Gainfree Leontief substitution flow problems,Mathematical Programming 57 (1992) 375–414.
J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley/Interscience, New York, 1980) Chapter 7.
G.J. Koehler, A.B. Whinston and G.P. Wright,Optimization over Leontief Substitution Systems (North-Holland, Amsterdam, 1975).
E. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
A.F. Torres and J.D. Araoz, Combinatorial models for searching in knowledge bases,Mathematicas, Acta Cientifica Venezolana 39 (1988) 387–394.
A.F. Veinott Jr, Extreme points of Leontief substitution systems,Linear Algebra and Its Application 1 (1968) 181–194.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cambini, R., Gallo, G. & Scutellà, M.G. Flows on hypergraphs. Mathematical Programming 78, 195–217 (1997). https://doi.org/10.1007/BF02614371
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02614371