Abstract
We present strongly polynomial algorithms to find rational and integer flow vectors that minimize a convex separable quadratic cost function on two-terminal series—parallel graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Bein, P. Brucker and A. Tamir, “Minimum cost flow algorithms for series parallel networks,”Discrete Applied Mathematics 10 (1985) 117–124.
R. Chandrasekaran and S. Kabadi, “Strongly polynomial algorithm for a class of combinatorial LCPs,”Operations Research Letters 6 (1987) 91–92.
R. Chandrasekaran and A. Tamir, “Algebraic optimization: the Fermat—Weber location problem,”Mathematical Programming 46 (1990) 219–224.
F. Granot and J. Skorin-Kapov, “Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm,”Mathematical Programming 46 (1990) 225–236.
F. Granot and J. Skorin-Kapov, “Some proximity and sensitivity results in quadratic integer programming,”Mathematical Programming 47 (1990) 259–268.
P. Hansen and D. Moon, “Dispersing facilities on a network,” RRR #52-88, RUTCOR, Rutgers University (New Brunswick, NJ, 1988).
D. Hochbaum, Private communication (May 1989).
D. Hochbaum, “Optimal algorithms for the allocation problem and its extensions,” Technical Report, IEOR Department, University of California (Berkeley, CA, 1990).
D. Hochbaum and J.G. Shanthikumar, “Convex separable optimization is not much harder than linear optimization,” to appear in:Journal of the ACM 1990.
T. Ibaraki and N. Katoh,Resource Allocation Problems: Algorithmic Approaches (The MIT Press, Cambridge, MA 1988).
M.K. Kozlov, S.P. Tarasov and L.G. Khachian, “The polynomial solvability of convex quadratic programming,”Soviet Mathematics Doklady 20(5) (1979) 1108–1111. [English translation.]
H. Luss and S. K. Gupta, “Allocation for effort resources among competitive activities,”Operations Research 23 (1975) 360–366.
Y. Mansour, B. Schieber and P. Tiwari, “Lower bounds for computations with the floor function,”SIAM Journal on Computing 20 (1991) 315–327.
M. Minoux, “A polynomial algorithm for minimum quadratic cost flow problems,”European Journal of Operational Research 18 (1984) 377–387.
M. Minoux, “Solving integer minimum cost flows with separable convex objective polynomially,”Mathematical Programming Study 26 (1986) 237–239.
L. Stockmeyer, “Arithmetic versus boolean operations in idealized register machines,” Technical Report RC 5954, IBM T.J. Watson Research Center (Yorktown Heights, NY, 1976).
A. Tamir, “Obnoxious facility location on graphs,”SIAM Journal on Discrete Mathematics 4 (1991) 550–567.
E. Tardos, “A strongly polynomial minimum cost circulation algorithm,”Combinatorica 5 (1985) 247–255.
J. Valdes, R.E. Tarjan and E.L. Lawler, “The recognition of series-parallel diagraphs,”SIAM Journal on Computing 11 (1982) 298–313.
N. Zadeh, “A bad network problem for the simplex method and other minimum cost flow algorithms,”Mathematical Programming 5 (1973) 255–266.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tamir, A. A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks. Mathematical Programming 59, 117–132 (1993). https://doi.org/10.1007/BF01581240
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581240