Finding the Kth shortest path in a time-schedule network
Year of publication: |
2005
|
---|---|
Authors: | Chen, Yen-Liang ; Tang, Kwei |
Published in: |
Naval research logistics : an international journal. - New York, NY : Wiley, ISSN 0894-069X, ZDB-ID 3924944. - Vol. 52.2005, 1, p. 93
|
Saved in:
Saved in favorites
Similar items by person
-
Cost-Sensitive Decision Tree with Multiple Resource Constraints
WU, Chia-Chi, (2010)
-
Critical path in an activity network with time constraints
Chen, Yen-Liang, (1997)
-
Discovering, frequency, and monetary (RFM) sequential patterns from customers' purchasing data
Chen, Yen-liang, (2009)
- More ...