Optimal procedures and complexity analyses of nonserial converging branch networks
Year of publication: |
1989
|
---|---|
Authors: | Lee, Chae Y. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 43.1989, 3, p. 327-341
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Application of the Graph Coloring Algorithm to the Frequency Assignment Problem
Park, Taehoon, (1996)
-
Genetic Algorithms for Single Machine Job Scheduling with Common Due Date and Symmetric Penalties
Lee, Chae Y., (1994)
-
Determination of the best main serial chain in nonserial dynamic programming networks
Lee, Chae Y., (1993)
- More ...