Selected Applications of Minimum Cuts in Networks

AbstractThis paper provides a review and a synthesis of applications of minimum cuts to a variety of combinatorial optimization problems, including linear and non-linear integer programming, problems in location theory, graph theory, sequencing and scheduling, and other areas. The central theme is a binary quadratic programming formulation of the minimum cut problem. After reviewing alternative formulations, extensions, and direct applications ofminimum cuts in network problems, the problem of finding a closure with maximum weight ina directed graph is considered. This problem can be solved as a minimum cut problem, which allows other related problems to be solved as a sequence of minimum cut problems. The paper concludes by exploring more difficult versions of the minimum cut problem involving negative capacities or additional constraints.

[1]  D. R. Fulkerson,et al.  A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.

[2]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[3]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[4]  D. R. Fulkerson.  A Network Flow Computation for Project Cost Curves , 1961 .

[5]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[6]  James E. Kelley,et al.  Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[7]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[8]  P. L. Ivanescu.  Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .

[9]  H. Weingartner.  Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

[10]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[11]  I. Frisch.  An Algorithm for Vertex-pair Connectivity , 1967 .

[12]  Thys B Johnson,et al.  OPTIMUM OPEN PIT MINE PRODUCTION SCHEDULING , 1968 .

[13]  M. Balinski.  Notes—On a Selection Problem , 1970 .

[14]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[15]  Cabot A.Victor,et al.  A Network Flow Solution to a Rectilinear Distance Facility Location Problem , 1970 .

[16]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[17]  G. O. Wesolowsky,et al.  Technical Note - The Optimal Location of New Facilities Using Rectangular Distances , 1971, Oper. Res..

[18]  R. Wilkov,et al.  Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..

[19]  Ellis L. Johnson.  On shortest paths and sorting , 1972, ACM Annual Conference.

[20]  H. Donald Ratliff,et al.  A Graph-Theoretic Equivalence for Integer Programs , 1973, Oper. Res..

[21]  M. R. Rao,et al.  Non-planar network with edges subject to failure and enumeration of proper cuts , 1973 .

[22]  H. D. Ratliff,et al.  Minimal Cost Cut Equivalent Networks , 1973 .

[23]  Alan J. Hoffman,et al.  A generalization of max flow—min cut , 1974, Math. Program..

[24]  Robert E. Tarjan,et al.  Testing graph connectivity , 1974, STOC '74.

[25]  Hamilton Emmons,et al.  Order‐preserving allocation of jobs to two machines , 1974 .

[26]  F. Hadlock,et al.  Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..

[27]  Jeffrey B. Sidney,et al.  Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs , 1975, Oper. Res..

[28]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[29]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[30]  H. D. Ratliff,et al.  Minimum cuts and related problems , 1975, Networks.

[31]  Robert F. Love,et al.  An Application of a Facilities Location Model in the Prestressed Concrete Industry , 1976 .

[32]  Dennis G. Severance,et al.  Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.

[33]  J. Picard.  Maximal Closure of a Graph and Applications to Combinatorial Problems , 1976 .

[34]  Alberto Martelli.  A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph , 1976, JACM.

[35]  M. Dessouky,et al.  Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept , 1977 .

[36]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[37]  Delbert Ray Fulkerson,et al.  Maximizing the minimum source-sink path subject to a budget constraint , 1977, Math. Program..

[38]  L. E. Trotter,et al.  On the Generality of Multi-Terminal Flow Theory , 1977 .

[39]  Masao Iri,et al.  Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time" , 1977, SIAM J. Comput..

[40]  Paul D. Seymour,et al.  The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.

[41]  J. C. Picard,et al.  On the integer-valued variables in the linear vertex packing problem , 1977, Math. Program..

[42]  H. D. Ratliff,et al.  A Cut Approach to the Rectilinear Distance Facility Location Problem , 1978, Oper. Res..

[43]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[44]  B. Golden.  A problem in network interdiction , 1978 .

[45]  V. A. Trubin,et al.  Effective algorithm for the weber problem with a rectangular metric , 1978 .

[46]  Lf McGinnis,et al.  The project coordinator's problem , 1978 .

[47]  A. J. Hoffman,et al.  D.R. Fulkerson’s contributions to polyhedral combinatorics , 1978 .

[48]  W. Lucas,et al.  Delbert Ray Fulkerson , 1978 .

[49]  Yossi Shiloach.  Multi-Terminal 0-1 Flow , 1979, SIAM J. Comput..

[50]  Salah E. Elmaghraby,et al.  Optimal project compression with due‐dated events , 1979 .

[51]  Zvi Galil,et al.  On Fulkerson's Conjecture About Consistent Labeling Processes , 1979, Math. Oper. Res..

[52]  P. Hansen.  Methods of Nonlinear 0-1 Programming , 1979 .

[53]  Rene Rochette,et al.  Order Preserving Allocation Of Jobs To Two Non-Identical Parallel Machines: A Solvable Case Of The Maximum Cut Problem , 1979 .

[54]  Michael O. Ball.  Computing Network Reliability , 1979, Oper. Res..

[55]  William R. Pulleyblank.  Minimum node covers and 2-bicritical graphs , 1979, Math. Program..

[56]  Alon Itai,et al.  Maximum Flow in Planar Networks , 1979, SIAM J. Comput..

[57]  M. Dessouky,et al.  The Cut Search Algorithm with Arc Capacities and Lower Bounds , 1979 .

[58]  J. Krarup,et al.  Selected Families of Location Problems , 1979 .

[59]  Claus-Peter Schnorr,et al.  Bottlenecks and Edge Connectivity in Unsymmetrical Networks , 1979, SIAM J. Comput..

[60]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[61]  Jørgen Tind,et al.  Blocking and Antiblocking Polyhedra , 1979 .

[62]  H. Donald Ratliff,et al.  A cut approach to a class of quadratic integer programming problems , 1980, Networks.

[63]  Victor Klee,et al.  Combinatorial Optimization: What is the State of the Art , 1980, Math. Oper. Res..

[64]  H. Crowder,et al.  Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality , 1980 .

[65]  Frank Ruskey,et al.  Circular Cuts in a Network , 1980, Math. Oper. Res..

[66]  Fred W. Glover,et al.  An extended abstract of an indepth algorithmic and computational study for maximum flow problems , 1980, Discret. Appl. Math..

[67]  To-Yat Cheung,et al.  Computational Comparison of Eight Methods for the Maximum Network Flow Problem , 1980, TOMS.

[68]  Maurice Queyranne,et al.  Theoretical Efficiency of the Algorithm "Capacity" for the Maximum Flow Problem , 1980, Math. Oper. Res..

[69]  Yossi Shiloach.  A Multi-Terminal Minimum Cut Algorithm for Planar Graphs , 1980, SIAM J. Comput..

[70]  Michael O. Ball,et al.  Complexity of network reliability computations , 1980, Networks.

[71]  Maurice Queyranne,et al.  On the structure of all minimum cuts in a network and applications , 1982, Math. Program..