The following pages link to (Q5309557):
Displaying 13 items.
- Checkpoint method for choice recovery in dynamic programming (Q263482) (← links)
- A combinatorial structure ensuring applicability of the dynamic programming method (Q918440) (← links)
- Justification of the dynamic programming method as applied to standardization-type problems (Q1571157) (← links)
- On optimisation of agri chains by dynamic programming (Q1598740) (← links)
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems (Q1736602) (← links)
- Dynamic programming and the backpacker's linear search problem (Q1903645) (← links)
- Dynamic programming method in bottleneck tasks distribution problem with equal agents (Q2795052) (← links)
- Design method of the iteration algorithms based on dynamic programming (Q2824953) (← links)
- Dynamic programming to minimize the maximum number of open stacks (Q2892372) (← links)
- (Q3485524) (← links)
- (Q3607881) (← links)
- An improved backward algorithm on dynamic programming (Q5400225) (← links)
- Beating a Benchmark: Dynamic Programming May Not Be the Right Numerical Approach (Q6159077) (← links)