论文信息 - An Approximation for a Continuous Max-Flow Problem

An Approximation for a Continuous Max-Flow Problem

We consider an approximation for the continuous max-flow problem stated in [2] by a sequence of max-flow problems in finite networks. The used approximation scheme was introduced by Gomory and Hu in [6, Chapter 12]. But in [6] there is no definition of a continuous flow and therefore also no proof of a convergence of network flows to continuous flows. In this sense this paper solves the central open problem of Chapter 12 in [6].

Wolfgang Blum | W. Blum

[1] W. A. Wilson. On Quasi-Metric Spaces , 1931 .

[2] S. Vajda,et al. Integer Programming and Network Flows , 1970 .

[3] W. Blum,et al. A measure-theoretical max-flow-min-cut problem , 1990 .

[4] D. R. Fulkerson,et al. Flows in Networks. , 1964 .

[5] Gilbert Strang,et al. Maximal flow through a domain , 1983, Math. Program..

[6] Hans G. Kellerer. Measure theoretic versions of linear programming , 1988 .

[7] Masao Iri,et al. Continuum approximation to dense networks and its application to the analysis of urban road networks , 1982 .

[8] Flemming Topsøe,et al. Topology and Measure , 1970 .

[9] T. C. Hu,et al. R-Separating Sets. , 1974 .

[10] Robert E. Tarjan,et al. Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem , 2008 .