Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices

DOI10.1051/ro/2011100zbMath1216.90071OpenAlexW2131932392MaRDI QIDQ3016172

Faouzi Ben Charrada, Sana Ezouaoui, Zaher Mahjoub

Publication date: 14 July 2011

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/197822

zbMATH Keywords

dynamic programmingcombinatorial optimizationgreedy algorithmparallel computingmatrix chain product

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (1)

Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices

Cites Work

• Unnamed Item
• Complexities of special matrix multiplication problems
• Fast algorithm for sparse matrix multiplication
• Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices
• Computation of Matrix Chain Products. Part II
• Computation of Matrix Chain Products. Part I
• An O(n) algorithm for determining a near-optimal computation order of matrix chain products

This page was built for publication: Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices