On Solving Quickest Time Problems in Time-Dependent, Dynamic Networks
JOURNAL OF MATHEMATICAL MODELLING AND ALGORITHMS ; 3 , 1 ; 39-71
2004-01-01
33 pages
Article (Journal)
English
DDC: | 003.3 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Quickest Cluster Flow Problems
British Library Conference Proceedings | 2011
|Solving time-dependent engineering problems with multiquadrics
Online Contents | 2005
|Galveston -- Port of quickest dispatch
Engineering Index Backfile | 1950
Quickest Paths in a Dynamic Network: A Faster Algorithm
British Library Conference Proceedings | 2002
|