Rod-Cutting Problem

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

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 2 of 2 algorithms

				See more
Dynamic Programming	1953	$O(n^2)$	$O(n)$
Brute Force	1940	$O(n 2^n)$	$O(n)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms