The construction of discrete dynamic programming algorithms
| Autor: | M. Held, R. M. Karp |
|---|---|
| Rok vydání: | 1965 |
| Předmět: |
Mathematical optimization
General Computer Science Computer science Computer Graphics and Computer-Aided Design Stochastic programming Inductive programming Theoretical Computer Science Computational Theory and Mathematics Dynamic problem Constraint programming Reactive programming Differential dynamic programming Programming domain Algorithm Software Functional reactive programming Information Systems |
| Zdroj: | IBM Systems Journal. 4:136-147 |
| ISSN: | 0018-8670 |
| DOI: | 10.1147/sj.42.0136 |
| Popis: | Certain sequencing and scheduling problems are formulated as shortest-route problems and treated in a uniform manner by dynamic programming. Computational considerations are discussed. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|