The following pages link to Speed-Up in Dynamic Programming (Q3958292):
Displaying 16 items.
- On heuristics for minimum length rectilinear partitions (Q582084) (← links)
- A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- Trees with exponentially growing costs (Q924721) (← links)
- Speeding up dynamic programming with applications to molecular biology (Q1121182) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Monotonicity and efficient computation of optimal dichotomous search (Q1308740) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries (Q2661782) (← links)
- The cone of Monge matrices: Extremal rays and applications (Q4861874) (← links)
- A Dynamic Programming Approach to Power Consumption Minimization in Gunbarrel Natural Gas Networks with Nonidentical Compressor Units (Q5139618) (← links)
- Revisiting “Computation of Matrix Chain Products'' (Q5233109) (← links)
- Optimal binary search trees (Q5906917) (← links)