Optimal procedures and complexity analyses of nonserial converging branch networks (Q918445)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal procedures and complexity analyses of nonserial converging branch networks |
scientific article; zbMATH DE number 4158412
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal procedures and complexity analyses of nonserial converging branch networks |
scientific article; zbMATH DE number 4158412 |
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
0 references
0.8669907
0 references
0.8608562
0 references
0.85875064
0 references
0.8529365
0 references
0.8458075
0 references
