Technical Notes - The first K minimum cost paths in a time-schedule network
Year of publication: |
2001
|
---|---|
Authors: | Chen, Y.-L. ; Rinks, D. ; Tang, K. |
Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 7160331. - Vol. 52.2001, 1, p. 102-108
|
Saved in:
Saved in favorites
Similar items by person
-
Critical path in an activity network with time constraints
Chen, Y.-L., (1997)
-
Time analysis for planning a path in a time-window network
Chen, Y.-L., (2003)
-
Finding the critical path in an activity network with time-switch constraints
Yang, H.-H., (2000)
- More ...