A new-old algorithm for minimum-cut and maximum-flow in closure graphs

Networks

Volumn 37, Issue 4, 2001, Pages 171-193

  Hochbaum, Dorit S ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Maximum closure; Maximum flow; Minimum cut; Open pit mining; Sensitivity analysis

Indexed keywords

EID: 0035402307     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.1012     Document Type: Article

References (65)

1. [1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms, and applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. [2] C. G. Alford and J. Whittle, Application of Lerchs-Grossmann pit optimization to the design of open pit mines, AusIMM/IE Aust Newman Combined Group, Large Open Pit Mining Conference, Oct. 1986, pp. 201-207.
3. [3] M.L. Balinski, On a selection problem, Mgmt Sci 17 (1970), 230-231.
4. [4] L. Caccetta and L.M. Giannini, On bounding techniques for the optimum pit limit problem, Proc AusIMM 290(4) (1985), 87-89.
5. [5] L. Caccetta and L.M. Giannini, The generation of minimum search patterns in the optimum design of open pit mines, AusIMM Bull Proc 293(5) (1988), 57-61.
6. [6] L. Caccetta, L.M. Giannini, and P. Kelsey, Optimum open pit design: A case study, Asia-Pacific J Oper Res 8 (1991), 166-178.
7. [7] B. V. Cherkassky and A. V. Goldberg, On implementing push-relabel method for the maximum-flow problem, Algorithmica 19 (1997), 390-410.
8. [8] T. Coleou, Technical parameterization of reserves for open pit design and mine planning, Proc 21st Int APCOM Symp, 1989, pp. 485-494.
9. [9] W.H. Cunningham, A network simplex method, Math Prog 1 (1976), 105-116.
10. [10] W. Cunningham, Optimal attack and reinforcement in a network, J ACM 32 (1985), 549-561.
11. [11] E. Dalhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis, The complexity of multiterminal cuts, SIAM J Comput 23 (1994), 864-894.
12. [12] B. Denby and D. Schofield, Genetic algorithms: A new approach to pit optimisation, Proc 24rd Int APCOM Symp, 1993, pp. 126-133.
13. [13] P.A. Dowd and A.H. Onur, Optimising open pit design and sequencing, Proc 23rd Int APCOM Symp, 1992, pp. 411-422.
14. [14] J. Edmonds and R. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, J ACM 19 (1972), 248-264.
15. [15] M. J. Eisner and D. G. Severance, Mathematical techniques for efficient record segmentation in large shared databases, J ACM 23 (1976), 619-635.
16. [16] B. Faaland and T. Schmitt, Scheduling tasks with due dates in fabrication/assembly process, Oper Res 35 (1987), 378-388.
17. [17] L. R. Ford, Jr. and D. R. Fulkerson, A simple algorithm for finding maximal network flows and an application to the Hitchcock problem, Can J Math 9 (1957), 210-218.
18. [18] D. Francois-Bongarcon and D. Guibal, Algorithms for parameterizing reserves under different geometrical constraints, Proc 17th Int APCOM Symp. 1982, pp. 297-309.
19. [19] D. Gale, A theorem of flows in networks, Pac J Math 7 (1957), 1073-1082.
20. [20] G. Gallo, M.D. Grigoriadis, and R.E. Tarjan, A fast parametric maximum-flow algorithm and applications, SIAM J Comput 18 (1989), 30-55.
21. [21] L. M. Giannini, L. Caccetta, P. Kelsey, and S. Carras, PITOPTIM: A new high speed network flow technique for optimum pit design facilitating rapid sensitivity analysis, AusIMM Proc 2 (1991), 57-62.
22. [22] A. V. Goldberg, Finding a maximum density subgraph, UC Berkeley report UCB/CSD/84/171, 1984.
23. [23] A. V. Goldberg, A new max-flow algorithm, Tech report MIT/LCS/TM-291, MIT, Cambridge MA, 1985.
24. [24] A.V. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, J Assoc Comput Mach 35 (1988), 921-940.
25. 2m) time, Math Prog 47 (1990), 353-365.
26. [26] D. Goldfarb and J. Hao, On strongly polynomial variants of the network simplex algorithm for the maximum-flow problem, OR Lett 10 (1991), 383-367.
27. [27] O. Goldschmidt and D.S. Hochbaum, A polynomial algorithm for the K-cut problem, Math Oper Res 19 (1994), 24-37.
28. [28] D. Gusfield, C. Martel, and D. Fernandez-Baca, Fast algorithms for bipartite network flow, SIAM J Comput 16 (1987), 237-251.
29. [29] P. Hansen and B. Simeone, Unimodular functions, Discr Appl Math 14 (1986), 269-281.
30. [30] R. Hassin, Maximum-flow in (s,t) planar networks, Inf Process Lett 13 (1981), 107.
31. [31] D.S. Hochbaum, On a polynomial class of nonlinear optimization problems, UC Berkeley manuscript, March 1990.
32. [32] D.S. Hochbaum, The pseudoflow algorithm: a new algorithm and a new simplex algorithm for the maximum-flow problem, UC Berkeley manuscript, April 1997.
33. [33] D.S. Hochbaum, A framework for half integrality and 2-approximations with applications to feasible cut and minimum satisfiability, UC Berkeley manuscript, April 1996. Extended abstract version in Proc APPROX98, Lecture Notes in Computer Science 1444, Jansen and Rolim (Editors), Springer-Verlag, 1998, Berlin Heidelberg, pp. 99-110.
34. [34] D. S. Hochbaum and A. Chen, Performance analysis and best implementations of old and new algorithms for the open-pit mining problem, Oper Res 48 (2000), 894-914.
35. [35] D. S. Hochbaum and S.-P. Hong, About strongly polynomial time algorithms for quadratic optimization over submodular constraints, Math Prog 69 (1995), 269-309.
36. [36] D.S. Hochbaum and J. Naor, Simple and fast algorithms for linear and integer programs with two variables per inequality, SIAM J Comput 23 (1994), 1179-1192.
37. [37] D.S. Hochbaum, N. Megiddo, J. Naor, and A. Tamir, Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality, Math Prog 62 (1993), 69-83.
38. [38] A. Hoffman and J. Rivlin, "When a team is 'mathematically' eliminated?" Princeton Symposium of Math Programming, 1967, H.W. Kuhn (Editor), Princeton University Press, Princeton, NJ, 1970, pp. 391-401.
39. [39] P. Huttagosol and R. Cameron, A computer design of ultimate pit limit by using transportation algorithm, Proc 23rd Int APCOM Symp 1992, pp. 443-460.
40. [40] T.B. Johnson, Optimum open pit mine production scheduling, Ph.D. Thesis, Dept. of IEOR, University of California, Berkeley, May 1968.
41. [41] T.B. Johnson and W.R. Sharp, A three-dimensional dynamic programming method for optimal ultimate open pit design, U.S. Bureau of Mines, Report of Investigation 7553, 1971.
42. [42] D.R. Karger and C. Stein, A new approach to the minimum-cut problem, J ACM 43 (1996), 601-640.
43. [43] Y.C. Kim, Ultimate pit limit design methodologies using computer Models - The state of the art, Mining Eng 30 (1978), 1454-1459.
44. [44] Y.C. Kim and W.L. Cai, Long range mine scheduling with 0-1 programming, Proc 22nd Int APCOM Symp 1990, pp. 131-144.
45. [45] V. King, S. Rao, and R. Tarjan, A faster deterministic maximum-flow algorithm, J Alg 17 (1994), 447-474.
46. [46] S. Koborov, Method for determining optimal open pit limits, Rapport Technique ED 74-R-4, Dept. of Mineral Engineering, Ecole Polytechnique de Montreal, Canada, Feb. 1974.
47. [47] E. Koenigsberg, The optimum contours of an open pit mine: An application of dynamic programming, Proc 17th Int APCOM Symp, 1982, pp. 274-287.
48. [48] E.L. Lawler, Combinatorial optimization: Networks and matroids, Holt Rinehart and Winston, New York, 1976.
49. [49] H. Lerchs and I.F. Grossmann, Optimum design of open-pit mines, Trans C.I.M. 68 (1965), 17-24.
50. [50] J.W. Mamer and S.A. Smith, Job completion based inventory systems: Optimal policies for repair kits and spare machines, Working paper no. 318, Western Management Science Institute, University of California, 1983.
51. [51] H. Nagamochi and T. Ibaraki, Computing edge-connectivity in multigraphs and capacitated graphs, SIAM J Discr Math 5 (1992), 54-66.
52. [52] D. Orlin, Optimal weapons allocation against layered defenses, Naval Res Log Q 34 (1987), 605-617.
53. [53] M. T. Pana, The simulation approach to open pit design, Proc 5th APCOM Symp, Tucson, AZ, 1965.
54. [54] J. C. Picard, Maximal closure of a graph and applications to combinatorial problems, Mgmt Sci 22 (1976), 1268-1272.
55. [55] J.C. Picard and M. Queyranne, Selected applications of minimum cuts in networks, INFOR 20 (1982), 394-422.
56. [56] J.M.W. Rhys, A selection problem of shared fixed costs and network flows, Mgmt Sci 17:3 (1970), 200-207.
57. [57] R.H. Robinson and N.B. Prenn, An open pit design model, Proc 15th Int APCOM Symp, 1977, pp. 1-9.
58. [58] B. Schwartz, Possible winners in partially complete tournaments, SIAM Rev 8 (1966), 302-308.
59. [59] D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, J Comput Syst Sci 24 (1983), 362-391.
60. [60] M. Stoer and F. Wagner, A simple min-cut algorithm, J ACM 44 (1997), 585-591.
61. [61] G.S. Thomas, Optimisation and scheduling of open pits via genetic algorithms and simulated annealing, Proc 1st Int Symp on Mine Simulation via the Internet, Paper TG085A, http://www.metal.ntua.gr/msslab/MineSim96.
62. [62] R. Vallet, Optimisation mathematique de l'exploitation d'une mine a ciel ouvert ou le problem de l'enveloppe, Ann Mine Belg Feb. (1976), 113-135.
63. [63] Q. Wang and H. Sevim, An alternative to parameterization in finding a series of maximum-metal pits for production planning, Proc 24th Int APCOM Symp, 1993, pp. 168-175.
64. [64] J. Whittle, The facts and fallacies of open pit optimization, manuscript, 1989.
65. [65] Y. Zhao and Y.C. Kim, A new optimum pit limit design algorithm, Proc 23rd Int APCOM Symp, 1992, pp. 423-434.