The Knapsack Problem: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=External= * https://www.coursera.org/learn/algorithms-greedy/lecture/LIgLJ/the-knapsack-problem =Internal= * Algorithms#Dynamic_Programming_Algorithms|Dynamic Programming A...") |
|||
| Line 5: | Line 5: | ||
=Overview= | =Overview= | ||
=Problem Defintion= | =Problem Defintion= | ||
The input is given by n items. Each item comes with a non-negative value v<sub>i</sub> and a non-negative and integral size w<sub>i</sub>. | |||
Revision as of 00:04, 28 October 2021
External
Internal
Overview
Problem Defintion
The input is given by n items. Each item comes with a non-negative value vi and a non-negative and integral size wi.