Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions

DOI10.1007/978-3-642-18381-2_13zbMath1298.90124OpenAlexW1869445902MaRDI QIDQ3075513

Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_13

zbMATH Keywords

dynamic programmingcost functionssequential optimizationmatrix chain multiplication

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (2)

Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ Dynamic programming bi-criteria combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of Matrix Chain Products. Part I
• On Optimization of Decision Trees

This page was built for publication: Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions