Pages that link to "Item:Q2538061"

The following pages link to The concept of state in discrete dynamic programming (Q2538061):

Displaying 9 items.

• A practical algorithm for decomposing polygonal domains into convex polygons by diagonals (Q1001364) (← links)
• Some comments on preference order dynamic programming models (Q1156704) (← links)
• Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
• Monotonicity and the principle of optimality (Q1838705) (← links)
• Algorithms for the decomposition of a polygon into convex polygons (Q1969864) (← links)
• Classes of discrete optimization problems and their decision problems (Q2265336) (← links)
• Solvable classes of discrete dynamic programming (Q2563309) (← links)
• A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
• A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set (Q4809666) (← links)