Abstract
We present an algorithm for finding a minimum spanning tree where the costs are the sum of two linear ratios. We show how upper and lower bounds may be quickly generated. By associating each ratio value with a new variable in `image space,' we show how to tighten these bounds by optimally solving a sequence of constrained minimum spanning tree problems. The resulting iterative algorithm then finds the globally optimal solution. Two procedures are presented to speed up the basic algorithm. One relies on the structure of the problem to find a locally optimal solution while the other is independent of the problem structure. Both are shown to be effective in reducing the computational effort. Numerical results are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal, V., Aneja, Y.P. and Nair, K.P.K. (1982), Minimal Spanning Tree Subject To A Side Constraint'. Computers and Operations Research 9(4): 287–296.
Almogy, Y. and Levin, O. (1969), Parametric Analysis of a Multi-Stage Stochastic Shipping Problem'. In: Proceedings of the Fifth IFORS Conference. Venice, Italy, pp. 359–370.
Almogy, Y. and Levin, O. (1971), A Class of Fractional Programming Problems'. Operations Research 19, 57–67.
Bitran, G.R. and Magnanti, T.L. (1976), Duality and Sensitivity Analysis for Fractional Programs'. Operations Research 24(4): 675–699.
Camerini, P.M., Galbiati, G. and Maffioli, F. (1988), Algorithms for Finding Optimum Trees: Description, Use and Evaluation'. Annals of Operations Research 13(1-4): 265–397.
Chandrasekaran, R. (1977), Minimal Ratio Spanning Trees'. Networks 7: 355–342.
Dinklebach, W. (1967), On Nonlinear Fractional Programming'. Management Science 13(7): 492–498.
Falk, J.E. and Palocsay, S.W. (1992), Optimizing the Sum of Linear Fractional Functions'. In: C. Floudas and M. Pardalos (eds.), Recent Advances in Global Optimization. Princeton, New Jersey: Princeton University Press, pp. 221–258.
Handler, G. and Zang, I. (1980), A Dual Algorithm for the Constrained Shortest Path Problem'. Networks 10(4): 293–310.
Hashizume, S., Fukushima, M., Katoh, N. and Ibaraki, T. (1987), Approximation Algorithms for Combinatorial Fractional Programming Problems'. Mathematical Programming 37(3), 255–267.
Lawler, E.L.: 1976, Combinatorial Optimization: Networks and Matroids. New York: Hold, Reinhart and Winston.
Meggido, N. (1979), Combinatorial optimization with rational objective functions'. Mathematics of Operations Research 4(4): 414–424.
Nagih, A. (1996), Sur La Résolution Des Programmes Fractionnaires En Variables 0-1'. Ph.D. thesis, Université Paris 13, Institut Galilée, Paris, France.
Radzik, T. (1992), Newton's method for fractional combinatorial optimization'. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. Pittsburg, Pennsylvania, pp. 659–669.
Schaible, S. (1995), Fractional Programming'. In: R. Horst and P. Pardalos (eds.), Handbook of Global Optimization Vol. 2. Dordrecht: Kluwer Academic Publishers, pp. 495–608. Also available as University of California, Riverside, A. Gary Anderson Graduate School of Management, Working Paper Series 94-08.
Schaible, S. (1996), Fractional Programming with Sums of Ratios'. Working Paper Series 96-04, University of California, Riverside, The A. Gary Anderson Graduate School of Management.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Skiscim, C.C., Palocsay, S.W. Minimum Spanning Trees with Sums of Ratios. Journal of Global Optimization 19, 103–120 (2001). https://doi.org/10.1023/A:1008340311108
Issue Date:
DOI: https://doi.org/10.1023/A:1008340311108