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
-
Context-based market basket analysis in a multiple-store environment
Tang, Kwei, (2008)
-
Discovering, frequency, and monetary (RFM) sequential patterns from customers' purchasing data
Chen, Yen-liang, (2009)
-
Cost-sensitive decision tree with multiple resource constraints
Wu, Chia-chi, (2010)
- More ...