Abstract
This chapter is devoted to the study of matrix chain multiplication problem. For this problem, we consider different cost functions and present a multi-stage optimization procedure relative to a sequence of such functions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chikalov, I., Hussain, S., Moshkov, M.: Sequential optimization of matrix chain multiplication relative to different cost functions. In: Cerná, I., Gyimóthy, T., Hromkovic, J., Jeffery, K.G., Královic, R., Vukolic, M., Wolf S. (eds.) SOFSEM 2011: Theory and Practice of Computer Science – 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22–28, 2011, Lecture Notes in Computer Science, vol. 6543, pp. 157–165. Springer, Berlin (2011)
Godbole, S.: On efficient computation of matrix chain products. IEEE Trans. Comput. 22(9), 864–866 (1973)
Hu, T.C., Shing, M.T.: Computation of matrix chain products. Part I. SIAM J. Comput. 11(2), 362–373 (1982)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M. (2019). Matrix Chain Multiplication. In: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-319-91839-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-91839-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91838-9
Online ISBN: 978-3-319-91839-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)