On this page about Optimal substructure:
In computer science, a problem is said to have optimal substructure if its optimal solution can be constructed efficiently from optimal solutions to its subproblems. This property is used to determine the usefulness of dynamic programming and greedy algorithms in a problem.
...
applied when the problem under concern has optimal substructure . Optimal substructure means that the... makes use of: Overlapping subproblem Optimal substructure Memoization Approaches Dynamic... programming is an important technique which belongs to the theory of optimization. Dynamic programming is...
Longest-common subsequence problem
an optimal-substructure property. The Optimal-Substructure of an LCS Theorem is Let X = Many computer...-substructure property. The Optimal-Substructure of an LCS Theorem is Let X = 1 ,...,x m > and Y = > and Y = 1... formula: The recursive formula relies on the Optimal Substructure Theorem in Part 1. It involves...
Dynamic programming/Implementations and Examples
...
algorithm Straddling checkerboard Subsequence Longest-common subsequence problem Optimal-substructure... Conway's Game of Life Collatz conjecture Combination Combinatorial optimization Combinatorial search... problem Mutual exclusion Rendezvous problem Derangement Dickson's lemma Discrete optimization Eight...
List of mathematical topics (M-O)
-- Operator norm Operator norm -- Operator theory Operator theory -- Optimal-substructure Optimal-substructure -- Optimization Optimization -- Optimization (mathematics) Optimization (mathematics) -- Oracle...
variables dynamic programming studies the case which has optimal substructure and overlapping... In mathematics, the term optimization refers to the study of problems that have the form Given: a..., if that is the goal) the objective function is called an optimal solution . In general there will...
programming . When a problem shows optimal substructure, i.e when the optimal solution to a problem consists of optimal solutions to subproblems (for instance the shortest path between two vertices on a... variance is to find close to globally optimal solutions rather than simply locally optimal ones, the...