Speed-Up in Dynamic Programming
From MaRDI portal
Publication:3958292
DOI10.1137/0603055zbMath0494.90082OpenAlexW2033751470MaRDI QIDQ3958292
Publication date: 1982
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0603055
design of efficient dynamic programming algorithmsgeneral speed-up techniqueoptimal order of multiplying a sequence of matrices
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Direct numerical methods for linear systems and matrix inversion (65F05) Algorithms in computer science (68W99)
Related Items (16)
Dynamic programming and graph optimization problems ⋮ Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions ⋮ Speeding up dynamic programming with applications to molecular biology ⋮ Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries ⋮ Perspectives of Monge properties in optimization ⋮ Operations research applications of dichotomous search ⋮ The cone of Monge matrices: Extremal rays and applications ⋮ A linear-time algorithm for concave one-dimensional dynamic programming ⋮ An optimal algorithm with unknown time complexity for convex matrix searching ⋮ Trees with exponentially growing costs ⋮ A Dynamic Programming Approach to Power Consumption Minimization in Gunbarrel Natural Gas Networks with Nonidentical Compressor Units ⋮ Dynamic programming with convexity, concavity and sparsity ⋮ Optimal binary search trees ⋮ On heuristics for minimum length rectilinear partitions ⋮ Revisiting “Computation of Matrix Chain Products ⋮ Monotonicity and efficient computation of optimal dichotomous search
Cites Work
This page was built for publication: Speed-Up in Dynamic Programming
