×

The facets of the polyhedral set determined by the Gale-Hoffman inequalities. (English) Zbl 0802.90041

Summary: The Gale-Hoffman inequalities characterize feasible external flow in a (capacitated) network. Among these inequalities, those that are redundant can be identified through a simple arc-connectedness criterion.

MSC:

90B10 Deterministic network models in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] E. Balas and W. Pulleyblank, ”The perfectly matchable subgraph polytope of a bipartite graph,”Networks 13 (1983) 495–516. · Zbl 0525.90069 · doi:10.1002/net.3230130405
[2] J.W. Chinneck, ”Localizing and diagnosing infeasibilities in networks,” Working Paper SCE-90-14, Carleton University (Ottawa, Ont., 1990).
[3] D. Gale, ”A theorem of flows in networks,”Pacific Journal of Mathematics 7 (1957) 1073–1082. · Zbl 0087.16303
[4] H.J. Greenberg, ”Diagnosing infeasibility in min-cost network flow problems. Part I: Primal infeasibility,”IMA Journal of Mathematics in Management 2 (1988) 39–51. · Zbl 0692.90046 · doi:10.1093/imaman/2.1.39
[5] M. Grötschel,Polyedrische Charakterisierungen Kombinatorischer Optimierungsprobleme (Hain, Meisenhein am Glan, 1977).
[6] A. Hoffman, ”Some recent applications of the theory of linear inequalities to extremal combinatorial analysis,”Proceedings Symposium Applied Mathematics 10 (1960) 113–128. · Zbl 0096.00606
[7] E. Horowitz and S. Shani,Fundamentals of Data Structures (Pitman, London, 1976).
[8] D. Klingman, A. Napier and J. Stutz, ”NETGEN – a program for generating large scale (un)capacitated assignment, transportation and minimum cost flow networks,”Management Science 20 (1974) 814–822. · Zbl 0303.90042 · doi:10.1287/mnsc.20.5.814
[9] A. Prékopa and E. Boros, ”On the existence of a feasible flow in a stochastic transportation network,”Operations Research 39 (1991) 119–129. · Zbl 0747.90041 · doi:10.1287/opre.39.1.119
[10] W. Pulleyblank, ”Polyhedral combinatorics,” in: A. Bachem, M. Grötschel and B. Korte, eds.,Mathematical Programming: The State of the Art (Springer, Berlin, 1983) pp. 312–345. · Zbl 0566.90063
[11] R.T. Rockafellar,Network Flows and Monotropic Optimization (Wiley, New York, 1984). · Zbl 0596.90055
[12] W. Wallace and R.J.-B. Wets, ”Preprocessing in stochastic programming: the case of capacited networks,” to appear in:ORSA Journal on Computing (1993).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.