Abstract
This paper presents a characterization of all minimum cuts, separating a source from a sink in a network. A binary relation is associated with any maximum flow in this network, and minimum cuts are identified with closures for this relation. As a consequence, finding all minimum cuts reduces to a straightforward enumeration. Applications of this results arise in sensitivity and parametric analyses of networks, the vertex packing and maximum closure problems, in unconstrained pseudo-boolean optimization and project selection, as well as in other areas of application of minimum cuts.
Preview
Unable to display preview. Download preview PDF.
References
D. Adolphson and T.C. Hu, “Optimal linear ordering”, Society for Industrial and Applied Mathematics Journal of Applied Mathematics 25 (1973) 403–423.
M.L. Balinski, “On a selection problem”, Management Science 17 (1970) 230–231.
D.W. Davies and D.L.A. Barber, Communication networks for computers (Wiley, Chichester, Great Britain, 1973).
L.R. Ford and D.R. Fulkerson, Flows in networks (Princeton University Press, Princeton, NJ, 1962).
R.L. Francis and P.B. Saunders, “EVACNET: Prototype network optimization models for building evacuation”, Report NBSIR 79-1738, National Bureau of Standards, Washington, DC (1979).
G. Gratzer, Lattice Theory: first concepts and distributive lattices (W.M. Freeman and Co., San Francisco, CA., 1971).
A.L. Gutjahr and G.J. Nemhauser, “An algorithm for the line balancing problem”, Management Science 11 (1964) 308–315.
Han Chang, “Funding the n most vital nodes in a flow network”, Dissertation. University of Texas at, Arlington, TX (1972).
T.C. Hu, Integer programming and network flows (Addison-Wesley, Reading, MA, 1970).
T.C. Hu, “Optimum communication spanning trees”, Society for Industrial and Applied Mathematics Journal of Computing 3 (1974) 188–195.
E.L. Lawler, “Efficient implementation of dynamic programming algorithms for sequencing problems”, Report bw 106/79, Stitchting Mathematisch Centrum, Amsterdam, The Netherlands (1979).
S.M. Lubore, H.D. Ratliff and G.T. Sicilia, “Determining the most vital link in a flow network”, Naval Research Logistic Quarterly 18 (1971) 497–502.
L.F. McGinnis and H.L.W. Nuttle, “The project coordinators’ problem”, Omega 6 (1978) 325–330.
E. Minieka, Optimization algorithms for networks and graphs (Marcel Dekker Inc., New York, 1978).
G.L. Nemhauser and L.E. Trotter, “Vertex packings: structural properties and algorithms”, Mathematical Programming 8 (1975) 232–248.
S. Phillips Jr. and M.E. Dessouky, “Solving the project time/cost tradeoff problem using the minimal cut concept”, Management Science 24 (1977) 393–400.
J.-C. Picard, “Maximal closure of a graph and application to combinatorial problems”, Management Science 22 (1976) 1268–1272.
J.-C. Picard and M. Queyranne, “Vertex packings: (VLP)—reductions through alternate labeling”, Technical report EP75-R-47, Ecole Polytechnique de Montréal, Que., Canada (1975).
J.-C. Picard and M. Queyranne, “On the integer-valued variables in the linear vertex packing problem”, Mathematical Programming 12 (1977) 97–101.
J.-C. Picard and M. Queyranne, “Networks graphs and some nonlinear 0–1 programming problems”, Technical report EP77-R-32, Ecole Polytechnique de Montréal, Que., Canada (1977).
J.-C. Picard and M. Queyranne, “Selected applications of the maximum flow and minimum cut problems”, Tech. Rept. EP79-R-35, Ecole Polytechnique de Montréal, Montréal, Qué., Canada (1979).
J.-C. Picard and H.D. Ratliff, “Minimum cuts and related problems”, Networks 5 (1975) 357–370.
M. Queyranne, “Anneaux achevés d’ensembles et préordres”, Technical report EP77-R-14, Ecole de Montréal, Que., Canada (1977).
J.M.W. Rhys, “A selection problem of shared fixed costs and network flows”, Management Science 17 (1970) 200–207.
L. Schrage and K.R. Baker, “Dynamic programming solution of sequencing problems with precedence constraints”, Operations Research 26 (1978) 444–449.
G.T. Sicilia, “Finding the n most vital links in a network”, Dissertation, University of Florida, Gainesville, FL, (1970).
D.M. Topkis, “Monotone minimum node-cuts in capacitated networks”, Research report ORC 70-39, University of California, Berkeley, CA, (1970).
R. Wollmer, “Sensitivity analysis in networks”, Technical repoot ORC 65-8, University of California, Berkeley, CA, (1965).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 The Mathematical Programming Society
About this chapter
Cite this chapter
Picard, JC., Queyranne, M. (1980). On the structure of all minimum cuts in a network and applications. In: Rayward-Smith, V.J. (eds) Combinatorial Optimization II. Mathematical Programming Studies, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120902
Download citation
DOI: https://doi.org/10.1007/BFb0120902
Received:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00803-0
Online ISBN: 978-3-642-00804-7
eBook Packages: Springer Book Archive