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

Abstract

This report discusses the research conducted by the research team at the Georgia Institute of Technology in the area of nonserial dynamic programming networks. The problems, approach and major results are summarized in Chapter 1, while the rest of the chapters discuss, in detail, the algorithm developments, experiment with sample problems, and algorithmic complexities. Each chapter contains detailed computer flow charts for the algorithms developed/ Chapter 6 employs an efficient dimensionality reduction algorithms known as the imbedded state space method in conjunction with the one developed in this study to treat an otherwise intractable problem involving feedforward loop systems . These algorithms are useful inputs to the development of dynamic programming based strategies for the analysis of complex nonserial networks.

Open PDF

Document Details

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

Entities

People

  • Augustine O. Esogbue

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computational Fluid Dynamics
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Dynamic Programming
  • Engineering
  • Equations
  • Mathematical Analysis
  • Mathematical Programming
  • Natural Gas
  • Operations Research
  • Systems Engineering
  • Three Dimensional
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Missile Defense Systems.
  • Neural Network Machine Learning.
  • Systems Analysis and Design

Technology Areas

  • Space
  • Space - Spacecraft Maneuvers