Picard, J. C.; Ratliff, H. D. Minimum cuts and related problems. (English) Zbl 0325.90047 Networks 5, 357-370 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 58 Documents MSC: 90C10 Integer programming 90C35 Programming involving graphs or networks 90C30 Nonlinear programming 90B10 Deterministic network models in operations research PDF BibTeX XML Cite \textit{J. C. Picard} and \textit{H. D. Ratliff}, Networks 5, 357--370 (1975; Zbl 0325.90047) Full Text: DOI References: [1] Balinski, Management Science 17 pp 230– (1970) [2] Ford, Canadian J. Math 8 pp 399– (1956) · Zbl 0073.40203 [3] Gomory, J. Siam 9 pp 551– (1961) [4] Gupta, J. Siam 14 pp 215– (1964) [5] Hammer (Ivanescu), Operations Research 13 pp 388– (1965) [6] and , Boolean Methods in Operations Research, Springer-Verlog, New York, 1968. [7] Picard, Operations Research 21 pp 261– (1973) [8] Picard, Management Science 19 pp 1087– (1973) [9] Rhys, Management Science 17 pp 200– (1970) 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.