Matrix Chain Scheduling Problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:1711:17, 15 February 2023‎ Admin talk contribs‎ 1,221 bytes +1,221‎ Created page with "{{DISPLAYTITLE:Matrix Chain Scheduling Problem (Matrix Chain Multiplication)}} == Description == The Matrix Chain Scheduling Problem (or MCSP) is an optimization problem� where the goal is to find the product sequence for evaluating a chain of matrix products and the processor schedule for the sequence such that the evaluation time is minimized on a parallel system. == Related Problems == Generalizations: Matrix Chain Ordering Problem Subproblem: Approximat..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Matrix_Chain_Scheduling_Problem"