Likewise, in computer science, if a problem can be solved optimally by breaking it into sub-problems and then recursively finding the optimal solutions to the sub-problems, then it is said to have optimal substructure. While some decision problems cannot be taken apart this way, decisions that span several points in time do often break apart recursively. In both contexts it refers to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics. Finding the shortest path in a graph using optimal substructure a straight line indicates a single edge a wavy line indicates a shortest path between the two vertices it connects (among other paths, not shown, sharing the same two vertices) the bold line is the overall shortest path from start to goal.ĭynamic programming is both a mathematical optimization method and an algorithmic paradigm. Not to be confused with Dynamic programming language or Dynamic problem.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |