This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chang S Y and Murty K G, The Steepest Descent Gravitational Method for LP, Discrete Applied Mathematics, Vol. 25, 211–240, 1989.
Dantzig G B, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963.
Goldfarb D and Sit W, Worst Case Behavior of the Steepest Edge Simplex Method, Discrete Applied Mathematics 4, 367–377, 1973.
Klee V and Kleinschmidt P, The d-step Conjecture and its Relatives, Mathematics of Operations Research 12, 718–755, 1987.
Klee V and Minty G J, How Good is the Simplex Algorithm?, in: Inequalities III (O. Shisha, ed), Academic Press, New York, 159–175, 1972.
Murty K G, The Gravitational Method for LP, OPSEARCH, Vol. 23, No. 4, 206–214, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morin, T.L., Prabhu, N., Zhang, Z. (1996). Complexity of the gravitational method for linear programming. In: Chandru, V., Vinay, V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62034-6_51
Download citation
DOI: https://doi.org/10.1007/3-540-62034-6_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62034-1
Online ISBN: 978-3-540-49631-1
eBook Packages: Springer Book Archive