Abstract
In this paper, we consider a convex optimization problem where the objective function is the sum of separable convex functions, the constraints are similar to those arising in the dual of a minimum cost flow problem (that is, of the form π(i) − π(j) ≤ wij), and the variables are required to take integer values within a specified range bounded by an integer U. Let m denote the number of constraints and (n+m) denote the number of variables. We call this problem the convex cost integer dual network flow problem. In this paper, we develop network flow based algorithms to solve the convex cost integer dual network flow problem efficiently. We show that using the Lagrangian relaxation technique, the convex cost integer dual network flow problem can be reduced to a convex cost primal network flow problem where each cost function is a piecewise linear convex function with integer slopes. We next show that the cost scaling algorithm for the minimum cost flow problem can be adapted to solve the convex cost integer dual network flow problem in O(nm log(n2/m) log(nU)) time. This algorithm improves the best currently available algorithm and is also likely to yield algorithms with attractive empirical performance.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference
Ahuja, R. K., T. L. Magnanti, and J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications, Prentice Hall, NJ.
Ahuja, R. K., and J. B. Orlin. 1997. A fast algorithm for the bipartite node weighted matching on path graphs with application to the inverse spanning tree problem. Working Paper, Sloan School of Management, MIT, Cambridge, MA.
Barlow, R. E., D. J. Bartholomew, D. J. Bremner, and H. D. Brunk. 1972. Statistical Inference under Order Restrictions. Wiley, New York.
Bertsekas, D. P. 1979. A distributed algorithm for the assignment problem. Working Paper, Laboratory for Information and Decision Sciences, MIT, Cambridge, MA.
Boros, E., and R. Shamir. 1991. Convex separable minimization over partial order constraints. Report No. RRR 27-91, RUTCOR, Rutgers University, New Brunswick, NJ.
Elmaghraby, S. E. 1978. Activity Networks: Project Planning and Control by Network Models. Wiley-Interscience, New York.
Hochbaum, D.S., and J.G. Shanthikumar. 1990. Convex separable optimization is not much harder than linear optimization. Journal of ACM 37, 843–862.
Karzanov, A. V., and S. T. McCormick. 1997. Poloynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM Journal on Computing 4, 1245–1275.
McCormick, S. T. 1998. Personal communications.
Robertson, T., F. T. Wright, and R. L. Dykstra. 1988. Order Restricted Statistical Inference. John Wiley & Sons, New York.
Rockafellar, R. T. 1984. Network Flows and Monotropic Optimization. Wiley-Interscience, New York.
Roundy, R. 1986. A 98% effective lot-sizing rule for a multi-product, multi-stage, production-/inventory system. Mathematics of Operations Research 11, 699–727.
Sokkalingam, P. T., R. K. Ahuja, and J. B. Orlin. 1999. Solving inverse spanning tree problems through network flow techniques. Operations Research, March–April Issue.
Tarjan, R. E. 1998. Personal Communications.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahuja, R.K., Hochbaum, D.S., Orlin, J.B. (1999). Solving the Convex Cost Integer Dual Network Flow Problem. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol 1610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48777-8_3
Download citation
DOI: https://doi.org/10.1007/3-540-48777-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66019-4
Online ISBN: 978-3-540-48777-7
eBook Packages: Springer Book Archive