Optimal procedures and complexity analyses of nonserial converging branch networks

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 556
  • Download : 3
The purpose of this paper is to develop the optimization procedures that reduce the dimensionality of the nonserial converging branch networks in dynamic programming. Space and computational complexities of the single convering branch system are analyzed and compared with two other methods. An efficient algorithm for the multi-converging branch network is developed by identifying the levels of branches. The space complexity of the procedure is also examined and compared. The determination of the best main serial chain is considered based on the complexity analysis. © 1989.
Publisher
Elsevier
Issue Date
1989-12
Language
English
Citation

European Journal of Operational Research, v.43, no.3, pp.327 - 341

ISSN
0377-2217
URI
http://hdl.handle.net/10203/23339
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0