On the Best Main Serial Chain of Nonserial Loop Networks in Dynamic Programming
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Chae Young | ko |
| dc.date.accessioned | 2013-02-24T12:38:08Z | - |
| dc.date.available | 2013-02-24T12:38:08Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1987-07 | - |
| dc.identifier.citation | OPERATIONAL RESEARCH, v.87, no.0, pp.890 - 902 | - |
| dc.identifier.issn | 1109-2858 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/57191 | - |
| dc.description.abstract | The determination of the best main serial chain in a nonserial network plays an important role in reducing the dimensionality required for its optimization via dynamic programming. We consider looped nonserial systems and present the characteristics of a best main serial chain in various types of nonserial network systems. The result is based on a complexity analysis of the algorithms proposed for such systems. | - |
| dc.language | English | - |
| dc.publisher | Springer Verlag | - |
| dc.title | On the Best Main Serial Chain of Nonserial Loop Networks in Dynamic Programming | - |
| dc.type | Article | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 87 | - |
| dc.citation.issue | 0 | - |
| dc.citation.beginningpage | 890 | - |
| dc.citation.endingpage | 902 | - |
| dc.citation.publicationname | OPERATIONAL RESEARCH | - |
| dc.contributor.localauthor | Lee, Chae Young | - |
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.