COMPLEX SYSTEMS AND THE SHORTEST PATH PROBLEM.

Document Type

Conference Proceeding

Publication Date

1-1-1987

Description

Optimization problems in design of test and reliability improvement for complex systems have the core problem of finding the shortest path between terminal points of the network. Dynamic programming is typically used to solve this problem. A simpler and more efficient technique is presented that is based on a flood search technique using the binary adjacency matrix to minimize computations.

This document is currently not available here.

Share

COinS