Optimal procedures and complexity analyses of nonserial converging branch networks
type: Item
instance of: scholarly article
title: Optimal procedures and complexity analyses of nonserial converging branch networks
zbMATH Open document ID: 0705.90093
DOI: 10.1016/0377-2217(89)90232-4
author: Chae Y. Lee
published in: European Journal of Operational Research
publication date: 1989-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 4158412
zbMATH Keywords: dimensional reduction
zbMATH Keywords: nonserial converging branch networks
reviewed by: Marek Kubale
MaRDI profile type: Publication
full work available at URL: 0377-2217(89)90232-4
OpenAlex ID: W2070302802
cites work: Superposition in branching allocation problems
cites work: Non-Serial Dynamic Programming — A Survey
cites work: Optimal analysis of large complex water resources conveyance systems via nonserial dynamic programming
cites work: Q3773672
cites work: Optimal procedures for dynamic programs with complex loop structures
Recommended article: Q3773672
Recommended article: Complexity and algorithms for convex network optimization and other nonlinear problems
Recommended article: Approximating optimum branchings in linear time
Recommended article: Branching Processes, the Max-Plus Algebra and Network Calculus
Recommended article: Branch and cut methods for network optimization
Recommended article: Q4346105
Recommended article: Q3763915
Recommended article: Bounds to Complexities of Networks for Sorting and for Switching
Recommended article: On the complexity of designing optimal branch-and-combine clock networks
description: scientific article; zbMATH DE number 4158412