Dynamic Programming

  1. Knapsack Problem Variants
    1. Knapsack Problem Foundation
      1. Resource Allocation Framework
        1. Weight and Value Constraints
        2. Zero-One Knapsack
          1. Problem Formulation
            1. Recurrence Relation
              1. Implementation Approaches
                1. Space Optimization Techniques
                2. Unbounded Knapsack
                  1. Unlimited Item Usage
                    1. Recurrence Modifications
                      1. Implementation Differences
                      2. Bounded Knapsack
                        1. Limited Item Quantities
                          1. State Space Expansion
                          2. Multi-Dimensional Knapsack
                            1. Multiple Constraint Types
                              1. State Space Complexity
                              2. Subset Sum Problems
                                1. Boolean Subset Sum
                                  1. Target Sum Achievement
                                    1. Partition Problems
                                      1. Equal Sum Partition
                                        1. K-Equal Sum Partition

                                    Previous

                                    7. String Dynamic Programming

                                    Go to top

                                    Next

                                    9. Tree Dynamic Programming