Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow

Mathematics of Operations Research

Volumn 25, Issue 1, 2000, Pages 76-104

  Shigeno, Maiko ^a   Iwata, Satoru ^b   McCormick, S Thomas ^c  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b OSAKA UNIVERSITY   (Japan)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COST ACCOUNTING; OPTIMIZATION; POLYNOMIALS;

MINIMUM COST FLOW (MCF) PROBLEMS; NEGATIVE CYCLE CANCELING ALGORITHMS; POSITIVE CUT CANCELING ALGORITHMS;

ALGORITHMS;

EID: 0034139016     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.1.76.15208     Document Type: Article

References (67)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. _, K. Mehlhorn, J. B. Orlin, R. E. Tarjan. 1990. Faster algorithms for the shortest path problem. J. ACM 37 213-233.
3. _, J. B. Orlin, R. E. Tarjan. 1989. Improved time bounds for the maximum flow problem. SIAM J. Comput. 18 939-954.
4. Armstrong, R. D., Z. Jin. 1997. A new strongly polynomial dual network simplex algorithm. Math. Programming 78 131-148.
5. Barahona, F., É. Tardos. 1989. Note on Weintraub's minimum-cost circulation algorithm. SIAM J. Comput. 18 579-583.
6. Bellman, R. E. 1958. On a routing problem. Quart. Appl. Math. 16 87-90.
7. Bertsekas, D. P. 1986. Distributed asynchronous relaxation methods for linear network flow problems. Working Paper, Laboratory for Information and Decision Systems, MIT, Cambridge, MA.
8. Busacker, R. G., T. L. Saaty. 1965. Finite Graphs and Networks: An Introduction with Applications. McGraw Hill, New York.
9. Cui, W., S. Fujishige. 1988. A primal algorithm for the submodular flow problem with minimum-mean cycle selection. J. Oper. Res. Soc. Japan 31 431-440.
10. Cunningham, W. H. 1979. Theoretical properties of the network simplex method. Math. Oper. Res. 4 196-208.
11. Edmonds, J., R. M. Karp 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19 248-264.
12. Engel, G. M., H. Schneider. 1975. Diagonal similarity and equivalence for matrices over groups with 0. Czech. Math. 25 389-403.
13. Ervolina, T. R., S. T. McCormick. 1993a. Two strongly polynomial cut canceling algorithms for minimum cost network flow. Discrete Appl. Math. 46 133-165.
14. _, S. T. McCormick. 1993b. Canceling most helpful total cuts for minimum cost network flow. Networks 23 41-52.
15. Fredman, M. L., R. E. Tarjan. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34 596-615.
16. Fujishige, S. 1991. Submodular functions and optimization. Annals of Discrete Mathematics, Volume 47. North-Holland, Amsterdam.
17. Fulkerson, D. R. 1961. An out-of-kilter method for minimum cost flow problems. SIAM J. Appl. Math. 9 18-27.
18. Gabow, H. N., R. E. Tarjan. 1989. Faster scaling algorithms for network problems. SIAM J. Comput. 18 1013-1036.
19. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York.
20. Gassner, B. J. 1964. Cycling in the transportation problem. Naval Res. Logist. Quart. 11 43-58.
21. Goldberg, A. V. 1995. Scaling algorithms for the shortest paths problem. SIAM J. Comput. 24 494-504.
22. _. 1997. An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithms 22 1-29.
23. _, S. Rao. 1998. Beyond the flow decomposition barrier. J. ACM 45 753-797.
24. _, R. E. Tarjan. 1988. A new approach to the maximum flow problem. J. ACM 35 921-940.
25. _, _. 1989. Finding minimum-cost circulations by canceling negative cycles. J. ACM 36 873-886.
26. _,_. 1990. Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15 430-466.
27. Goldfarb, D., J. Hao, S. Kai. 1990. Anti-stalling pivot rules for the network simplex algorithm. Networks 20 79-91.
28. Hadjiat, M. 1994. Un algorithme fortement polynomial pour la tension de coût minimum basé sur les cocycles de couts moyens minimums. Technical Report, Groupe Intelligence Artificielle, Faculté des Sciences de Luminy, Marseille, France.
29. Hassin, R. 1983. The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm. Math. Programming 25 228-239.
30. _. 1992. Algorithm for the minimum cost circulation problem based on maximizing the mean improvement. Oper. Res. Letters 12 227-233.
31. Hochbaum, D. S., J. G. Shanthikumar. 1990. Convex separable optimization is not much harder than linear optimization. J. ACM 37 843-862.
32. Hoffman, A. J. 1960. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. R. Bellman, M. Hall Jr., eds., Proc. of Symposia in Applied Mathematics, Vol. X Combinatorial Analysis. American Mathematical Society, Providence RI. 113-127.
33. Iwano, K., S. Misono, S. Tezuka, S. Fujishige. 1994. A new scaling algorithm for the maximum mean cut problem. Algorithmica 11 243-255.
34. Iwata, S., S. T. McCormick, M. Shigeno. 1999a. Fast cycle canceling algorithms for minimum cost submodular flow, submitted to Combinatorica; an extended abstract appears as "A faster algorithm for minimum cost submodular flows" Proc. Ninth Ann. ACM-SIAM Symposium Discrete Algorithms (1998) 167-174.
35. Iwata, S., S. T. McCormick, M. Shigeno. 1999a. Fast cycle canceling algorithms for minimum cost submodular flow, submitted to Combinatorica; an extended abstract appears as "A faster algorithm for minimum cost submodular flows" Proc. Ninth Ann. ACM-SIAM Symposium Discrete Algorithms (1998) 167-174.
36. _, _, _. 1999b. A strongly polynomial cut canceling algorithm for minimum cost submodular flow, submitted to SIAM J. on Discrete Math.; an extended abstract appears as "A strongly polynomial cut canceling algorithm for the submodular flow problem". G. Cornuéjols, R. E. Burkard, G. J. Woeginger, editors. Proc. Seventh MPS Conf. Integer Programming Combinatorial Optim. 259-272.
37. _, _, _. 1999b. A strongly polynomial cut canceling algorithm for minimum cost submodular flow, submitted to SIAM J. on Discrete Math.; an extended abstract appears as "A strongly polynomial cut canceling algorithm for the submodular flow problem". G. Cornuéjols, R. E. Burkard, G. J. Woeginger, editors. Proc. Seventh MPS Conf. Integer Programming Combinatorial Optim. 259-272.
38. _, _, _. 1999c. A relaxed cycle-canceling approach to separable convex optimization in unimodular linear space. Manuscript, University of British Columbia, Vancouver, B.C., Canada.
39. _, _, _. 1999d. A faster primal-dual algorithm for minimum cost submodular flow, submitted to Inform. Processing Letters.
40. Johnson, D. B. 1982. A priority queue in which initialization and queue operations take O(log log D) time. Math. Systems Theory 14 295-309.
41. Karp, R. M. 1978. A characterization of the minimum cycle mean in a digraph. Discrete Math. 23 309-311.
42. Karzanov, A. V., S. T. McCormick. 1997. Polynomial methods for separable convex optimization in totally unimodular linear spaces with applications to circulations and co-circulations in networks. SIAM J. Comput. 26 1245-1275.
43. King, V., S. Rao, R. Tarjan. 1994. A faster deterministic maximum flow algorithm. J. Algorithms 17 447-474.
44. Klein, M. 1967. A primal method for minimal cost flows with applications to the assignment and transportation problems. Management Sci. 14 205-220.
45. McCormick, S. T. 1993. Approximate binary search algorithms for mean cuts and cycles. Oper. Res. Letters 14 129-132.
46. _, T. R. Ervolina. 1994. Computing maximum mean cuts. Discrete Appl. Math. 52 53-70.
47. _, _, B. Zhou. 1994. Mean canceling algorithms for general linear programs, and why they (probably) don't work for submodular flow. Working Paper 94-MSC-011, UBC Faculty of Commerce, Vancouver, B.C.
48. _, L. Liu. 1993. An experimental implementation of the dual cancel and tighten algorithm for minimum cost network flow. D. S. Johnson, C. S. McGeoch, eds. Network Flows and Matching. American Mathematical Society DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 12 247-266.
49. _, A. Shioura. 1999. Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. Submitted to OR Letters.
50. _, A. Schulz, A. Shioura, R. Weismantel. 1999. A Note on an Augmentation Method for Mixed Integer Programming Problems. Manuscript, University of British Columbia, Vancouver, B.C., Canada.
51. Megiddo, N. 1983. Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30 852-865.
52. Minty, G. J. 1960. Monotone networks. Proc. Royal Soc. London 257A 194-212.
53. Orlin, J. B. 1993. A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41 338-350.
54. _. 1997. A polynomial time primal network simplex algorithm for minimum cost flows. Math. Programming 78 109-129.
55. _, R. K. Ahuja. 1992. New scaling algorithms for the assignment and minimum cycle mean problems. Math. Programming 54 41-56.
56. _, S. Plotkin, É. Tardos. 1993. Polynomial dual network simplex algorithms. Math. Programming 60 255-276.
57. Phillips, S., J. Westbrook. 1993. Online load balancing and network flow. Proc. 25th Ann. ACM Symposium on Theory of Comput. 402-411.
58. Queyranne, M. N. 1980. Theoretical efficiency of the algorithm capacity for the maximum flow problem. Math. Oper. Res. 5 258-266.
59. Radzik, T. 1992. Newton's method for fractional combinatorial optimization. Proc. 33rd IEEE Annual Symp. of Foundations of Computer Science 659-669; see also Parametric flows, weighted means of cuts, and fractional combinatorial optimization. P. Pardalos, ed. Complexity in Numerical Optimization. World Scientific, 1993, 351-386.
60. Radzik, T. 1992. Newton's method for fractional combinatorial optimization. Proc. 33rd IEEE Annual Symp. of Foundations of Computer Science 659-669; see also Parametric flows, weighted means of cuts, and fractional combinatorial optimization. P. Pardalos, ed. Complexity in Numerical Optimization. World Scientific, 1993, 351-386.
61. _, A. V. Goldberg. 1994. Tight bounds on the number of minimum-mean cycle cancellations and related results. Algorithmica 11 226-242.
62. Sleator, D. D., R. E. Tarjan. 1983. A data structure for dynamic trees. J. Comput. System Sci. 26 362-391.
63. Tardos, É. 1985. A strongly polynomial minimum cost circulation algorithm. Combinatorica 5 247-255.
64. Tarjan, R. E. 1997. Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm. Math. Programming 78 169-177.
65. Wallacher, C. 1991. A generalization of the minimum-mean cycle selection rule in cycle canceling algorithms. Report, Inst. Für Ang. Math., Braunschweig.
66. Weintraub, A. 1974. A primal algorithm to solve network flow problems with convex costs. Management Sci. 21 87-97.
67. Zadeh, N. 1973. A bad network problem for the simplex method and other minimum cost flow algorithms. Math. Programming 5 255-266.