On a language for discrete dynamic programming and a microcomputer implementation

DOI10.1016/0305-0548(89)90047-6zbMath0659.90093OpenAlexW2050856907MaRDI QIDQ1112738

Bryan L. Deuermeyer, Guy L. Curry

Publication date: 1989

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(89)90047-6

zbMATH Keywords

shortest pathmodeling languageknapsacksequential decision problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Formal languages and automata (68Q45) Dynamic programming (90C39)

Related Items (1)

A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code

Cites Work

• Unnamed Item
• The art and theory of dynamic programming
• Scheduling to Minimize Interaction Cost
• Contraction Mappings in the Theory Underlying Dynamic Programming

This page was built for publication: On a language for discrete dynamic programming and a microcomputer implementation