Abstract
This chapter presents algorithm for finding Pareto optimal points corresponding to Pareto optimal element partition trees, and it suggests different applications of this algorithm.
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 subscriptionsReferences
AbouEisha, H., Jopek, K., Medygrał, B., Nosek, S., Moshkov, M., Paszynska, A., Paszynski, M., Pingali, K.: Hybrid direct and iterative solver with library of multi-criteria optimal orderings for \(h\) adaptive finite element method computations. In: Connolly, M. (ed.) International Conference on Computational Science 2016, ICCS 2016, June 6–8, 2016, San Diego, California, USA. Procedia Computer Science, vol. 80, pp. 865–874. Elsevier (2016)
Luce, R., Ng, E.G.: On the minimum FLOPs problem in the sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 35(1), 1–21 (2014)
Valluri, M., John, L.K.: Is compiling for performance - compiling for power? In: Lee, G., Yew, P.C. (eds.) Interaction between Compilers and Computer Architectures, pp. 101–115. Springer, New York (2001)
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). Bi-criteria Optimization of Element Partition Trees. 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-91839-6_15
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)