Polynomial methods for separable convex optimization in unimodular linear spaces with applications

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 1245-1275

  Karzanov, Alexander V ^a   Mccormick, S Thomas ^b  

^a INSTITUTE FOR SYSTEMS ANALYSIS   (Russian Federation)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Min mean canceling; Network flows; Separable convex optimization; Unimodular linear spaces

Indexed keywords

COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS;

OBJECTIVE FUNCTIONS; SEPARABLE CONVEX OPTIMIZATION; UNIMODULAR LINEAR SPACES;

PIECEWISE LINEAR TECHNIQUES;

EID: 0031209772     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794263695     Document Type: Article

References (33)

1. R. K. AHUJA, T. L. MAGNANTI, AND J. B. ORLIN, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, New York, NY, 1993.
2. T. R. ERVOLINA AND S. T. MCCORMICK, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Discrete Appl. Math, 46 (1993), pp. 133-165.
3. M. FLORIAN, Nonlinear cost network models in transportation analysis, Math. Prog. Stud., 26 (1986), pp. 167-196.
4. A. FRANK AND A. V. KARZANOV, Determining the distance to the perfect matching polytope of a bipartite graph, Technical Report RR 895-M, Laboratoire ARTEMIS IMAG, Université Joseph Fourier, Grenoble, France, 1992.
5. A. V. GOLDBERG AND R. E. TARJAN, Finding minimum-cost circulations by canceling negative cycles, J. Assoc. Comput. Mach., 36 (1989), pp. 873-886.
6. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
7. M. HADJIAT, Un algorithme fortement polynomial pour la tension de coût minimum basé sur les cocycles de coûts moyens minimums, Technical Report, Groupe Intelligence Artificielle, Faculté des Sciences de Luminy, Marseille, France, 1994 (in French).
8. R. HASSIN, The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm, Math. Programming, 25 (1983), pp. 228-239.
9. R. HASSIN, A flow algorithm for network synchronization, Working Paper, Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv, 1993.
10. D. S. HOCHBAUM, Polynomial and strongly polynomial algorithms for convex network optimization, in Network Optimization Problems, D. Z. Du and P. M. Pardalos, eds., World Scientific, Singapore, 1993, pp. 63-92.
11. D. S. HOCHBAUM AND J. G. SHANTHIKUMAR, Convex separable optimization is not much harder than linear optimization, J. Assoc. Comput. Mach., 37 (1990), pp. 843-862.
12. T. IBARAKI, A. V. KARZANOV, AND H. NAGAMOCHI, Determining the distance to the flow polyhedron of a network, private communication, 1993.
13. K. IWANO, S. MISONO, S. TEZUKA, AND S. FUJISHIGE, A new scaling algorithm for the maximum mean cut problem, Algorithmica, 11 (1994), pp. 243-255.
14. R. M. KARP, A characterization of the minimum cycle mean in a digraph, Discrete Math., 23 (1978), pp. 309-311.
15. A. V. KARZANOV, Minimum mean weight cuts and cycles in directed graphs, in Methods for Solving Operator Equations, Yaroslavl State University, Yaroslavl, Russia, 1985, pp. 72-83 (in Russian); Amer. Math. Soc. Transl. (2), 158 (1994), pp. 47-55 (in English).
16. A. V. KARZANOV, Minimum mean weight cuts and cycles in directed graphs, in Methods for Solving Operator Equations, Yaroslavl State University, Yaroslavl, Russia, 1985, pp. 72-83 (in Russian); Amer. Math. Soc. Transl. (2), 158 (1994), pp. 47-55 (in English).
17. T. L. MAGNANTI, Models and algorithms for predicting urban traffic equilibria, in Transportation Planning Models, M. Florian, ed., North-Holland, Amsterdam, 1984, pp. 153-186.
18. Y. MANSOUR, B. SCHIEBER, AND P. TIWARI, Lower bounds for computations with the floor operation, manuscript, 1988.
19. S. T. MCCORMICK, Approximate binary search algorithms for mean cuts and cycles, Oper. Res. Lett., 14 (1993), pp. 129-132.
20. S. T. MCCORMICK AND L. LIU, An experimental implementation of the dual cancel and tighten algorithm for minimum cost network flow, in Network Flows and Matching, D. S. Johnson and C. S. McGeoch, eds., American Mathematical Society DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 12, AMS, Providence, RI, 1993, pp. 247-266.
21. S. T. MCCORMICK, T. R. ERVOLINA, AND B. ZHOU, Mean cancelling algorithms for general linear programs, and why they (probably) don't work for submodular flow, Working Paper 94-MSC-011, Faculty of Commerce, University of British Columbia, Vancouver, BC, Canada, 1994.
22. N. MEGIDDO, Combinatorial optimization with rational objective functions, Math. Oper. Res., 4 (1979), pp. 414-424.
23. N. MEGIDDO, Applying parallel computation algorithms in the design of serial algorithms, J. Assoc. Comput. Mach., 30 (1983), pp. 852-865.
24. M. MINOUX, A polynomial algorithm for minimum quadratic cost flow problems, Europ. J. Oper. Res., 18 (1984), pp. 377-387.
25. M. MINOUX, Solving integer minimum cost flows with separable convex cost objective polynomially, Math. Prog. Stud., 26 (1986), pp. 237-239.
26. A. S. NEMIROVSKY AND D. B. YUDIN, Problem Complexity and Method Efficiency in Optimization, Wiley-Interscience, Toronto, 1983.
27. J. B. ORLIN AND R. K. AHUJA, New scaling algorithms for the assignment and minimum cycle mean problems, Math. Programming, 54 (1988), pp. 41-56.
28. T. RADZIK, Parametric flows, weighted means of cuts, and fractional combinatorial optimization, in Complexity in Numerical Optimization, P. Pardalos, ed., World Scientific, Singapore, 1993, pp. 351-386.
29. T. RADZIK AND A. V. GOLDBERG, Tight bounds on the number of minimum-mean cycle cancellations and related results, Algorithmica, 11 (1994), pp. 226-242.
30. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
31. R. T. ROCKAFELLAR, Network Flows and Monotropic Optimization, Wiley-Interscience, New York, 1984.
32. A. SCHRIJVER, Theory of Linear and Integer Programming, John Wiley, New York, 1986.
33. É. TARDOS, A strongly polynomial algorithm to solve combinatorial linear programs, Oper. Res., 34 (1986), pp. 250-256.