Extensions of dynamic programming for multi-stage combinatorial optimization

Computer Science

• Dynamic Programming 100%
• Combinatorial Optimisation 100%
• Directed Acyclic Graph 50%
• Considered Problem 50%
• Programming Framework 25%
• Dynamic Programming Algorithm 25%
• Directed Graphs 25%
• Time Complexity 25%
• Conventional Algorithm 25%
• Subgraphs 25%
• Least Squares Methods 25%
• Complexity Analysis 25%
• Combinatorial Optimization Problem 25%
• Convex Polygon 25%
• Multi-Stage Optimization 25%
• Binary Search Tree 25%
• Randomly Generated Instance 25%
• Correctness Proofs 25%
• Sequence Alignment 25%
• Objective Function 25%

Mathematics

• Cost Function 100%
• Considered Problem 50%
• Directed Acyclic Graph 50%
• Matrix 25%
• Polygon 25%
• Least Square 25%
• Subproblem 25%
• Illustrative Example 25%
• Element Set 25%
• Number 25%
• Clustering 25%
• Input Node 25%
• Optimal Path 25%
• Sequence Alignment 25%
• Combinatorial Optimization Problem 25%

Keyphrases

• Programming Solution 25%
• Functional Node 25%
• Convex Polygon Triangulation 25%
• Input Nodes 25%
• Broken Line 25%
• Circuit Function 25%
• Maximum Subarray Problem 25%
• One-dimensional Clustering 25%
• Set Union 25%