Dynamic Programming Algorithms and Analyses for Nonserial Networks. Part II.

Abstract

The design of algorithm plays an important role in operations research in general and dynamic programming in particular. In most dynamic programming algorithms, formalism of computing, data structure and complexity analysis does not appear. One of the objectives of this research is to provide such a formalism. Converging branch, diverging branch, feed-forward loop and feedback loop systems are considered. In each case, first, a high level algorithm followed by the detailed computer algorithm is described. Formulas for storage and computational complexities for each computer algorithm are derived. Finally algorithms are implemented on VAX-11/780 computers using UCSD PASCAL. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1983
Accession Number
ADA130905

Entities

People

  • Nazir A. Warsi

Organizations

  • University of Atlanta

Tags

Communities of Interest

  • C4I
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computers
  • Dynamic Programming
  • Feedback
  • Notation
  • Operations Research
  • Optimization

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Operations Research
  • Systems Analysis and Design