Pages that link to "Item:Q2563309"
From MaRDI portal
The following pages link to Solvable classes of discrete dynamic programming (Q2563309):
Displaying 9 items.
- The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
- Systolic processing for dynamic programming problems (Q1099090) (← links)
- Dynamic programming is optimal for certain sequential decision processes (Q1139505) (← links)
- On the optimality of algorithms for finite state sequential decision processes (Q1228439) (← links)
- Monotonicity and the principle of optimality (Q1838705) (← links)
- The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
- Classes of discrete optimization problems and their decision problems (Q2265336) (← links)
- A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647) (← links)
- Discrete Decision Process Model Involves Greedy Algorithm over Greedoid (Q4272559) (← links)
