Rod-Cutting Problem (Rod-Cutting Problem)
Revision as of 11:25, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Rod-Cutting Problem (Rod-Cutting Problem)}} == Description == Given a rod of length $n$, and prices $p_i$ for which one can sell a segment of the rod of length $i$ ($1 \leq i \leq n$), find the splitting of the rod for which one can earn the most money once they sell the rod segments produced. == Parameters == <pre>n: length of rod</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year...")
Description
Given a rod of length $n$, and prices $p_i$ for which one can sell a segment of the rod of length $i$ ($1 \leq i \leq n$), find the splitting of the rod for which one can earn the most money once they sell the rod segments produced.
Parameters
n: length of rod
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Brute Force | 1940 | $O(n*{2}^n)$ | $O(n)$ | Exact | Deterministic | |
| Dynamic Programming | 1953 | $O(n^{2})$ | $O(n)$ | Exact | Deterministic |
Time Complexity graph
Space Complexity graph
Pareto Decades graph
