论文信息 - A Primal Simplex Variant for the Maximum Flow Problem

A Primal Simplex Variant for the Maximum Flow Problem

Abstract : This paper presents a number of specialized implementations of the primal simplex algorithm for the maximum flow problem. Computational results indicate that some of these variants are both faster and require less computer storage than our best implementation of the classic labeling algorithm for maximum flow problems. (Author)

F. Glover | D. Klingman | J. Mote | D. Whitman

[1] Risk and hazard in logistics planning , 1955 .

[2] D. R. Fulkerson,et al. Computation of maximal flows in networks , 1955 .

[3] 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.

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

[5] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[6] Fred W. Glover,et al. Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems , 1974, Networks.

[7] John M. Mulvey,et al. Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[8] F. Glover,et al. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees , 1979, Networks.

[9] Darwin Klingman,et al. Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .

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