CATALOG
7.2 Dynamic programming
7.2 Dynamic programming — learning path connecting EDA fundamentals to open practice.
In this section
01
Geometric programming
The line segment connecting x1 and x2 is called a closed line segment if it includes the …
027.2.4 Interval DP
Characteristics of interval DP: Two or more parts can be integrated, or vice versa; the p…
037.2.2 Integer programming
Here we can directly list an equation that is a 0-1 planning. Assume the variable xi, "…
047.2.3 Tree DP
7.2.3 Tree DP — learning path connecting EDA fundamentals to open practice.
057.2.5 State Compression DP
There are 6 commonly used operators, namely AND (&), OR (|), XOR (^), negation (~), l…
067.2.1 Knapsack problem
There are N kinds of items, the volume of the i-th item is Ci, the value is Wi, and the q…