Finding the critical path in an activity network with time-switch constraints
Year of publication: |
2000
|
---|---|
Authors: | Yang, H.-H. ; Chen, Y.-L. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 2430034. - Vol. 120.2000, 3, p. 603-613
|
Saved in:
Saved in favorites
Similar items by person
-
Investigation of path-following algorithms for signomial geometric programming problems
Yang, H.-H., (1997)
-
Technical Notes - The first K minimum cost paths in a time-schedule network
Chen, Y.-L., (2001)
-
Time analysis for planning a path in a time-window network
Chen, Y.-L., (2003)
- More ...