Optimal procedures and complexity analyses of nonserial converging branch networks (Q918445): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Superposition in branching allocation problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Non-Serial Dynamic Programming — A Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal analysis of large complex water resources conveyance systems via nonserial dynamic programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3773672 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal procedures for dynamic programs with complex loop structures / rank | |||
Normal rank | |||
Latest revision as of 10:15, 21 June 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
0 references
