Optimal procedures and complexity analyses of nonserial converging branch networks (Q918445): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q237429 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Marek Kubale / rank | |||
Normal rank |
Revision as of 15:40, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal procedures and complexity analyses of nonserial converging branch networks |
scientific article |
Statements
Optimal procedures and complexity analyses of nonserial converging branch networks (English)
0 references
1989
0 references
This paper develops optimization procedures that reduce the dimensionality of nonserial converging branch networks in dynamic programming. The author analyzes the time and space complexity of a single converging branch system and compares his results with that of two other methods. By identifying the levels of branches he develops an efficient algorithm for the multi-converging branch network. On the basis of a complexity analysis he determines the best main serial chain.
0 references
dimensional reduction
0 references
nonserial converging branch networks
0 references