Incremental versus non-incremental dynamic programming

DOI10.1016/j.orl.2018.02.003OpenAlexW2792757825MaRDI QIDQ2417149

Stasys P. Jukna

Publication date: 11 June 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2018.02.003

zbMATH Keywords

dynamic programmingcomplexity lower boundstropical branching program

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Uses Software

• Algorithm 97

Cites Work

• Lower bounds for tropical circuits and dynamic programs
• Tropical Complexity, Sidon Sets, and Dynamic Programming
• On a routing problem
• A Dynamic Programming Approach to Sequencing Problems
• Some Exact Complexity Results for Straight-Line Computations over Semirings
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: Incremental versus non-incremental dynamic programming