Shortest paths in a network with time-dependent flow speeds

By Sung K.   Bell M.G.H.   Seong M.   Park S.  

European Journal of Operational Research, Vol. 121, Iss. 1, 2000-02 ,pp. : 32-39

Elsevier

Access to resources Recommend Favorite

Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks

By Davies C.   Lingras P.  

European Journal of Operational Research, Vol. 144, Iss. 1, 2003-01 ,pp. : 27-38

Elsevier

Access to resources Recommend Favorite

A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks

By Modesti P.   Sciomachen A.  

European Journal of Operational Research, Vol. 111, Iss. 3, 1998-12 ,pp. : 495-508

Elsevier

Access to resources Recommend Favorite

A directed hypergraph model for random time dependent shortest paths

By Pretolani D.  

European Journal of Operational Research, Vol. 123, Iss. 2, 2000-06 ,pp. : 315-324

Elsevier

Access to resources Recommend Favorite

The dynamic predicate stashing copy problem and the Steiner problem in graphs

By Marsman S.   Duin C.W.   Volgenant A.  

European Journal of Operational Research, Vol. 125, Iss. 3, 2000-09 ,pp. : 526-534

Elsevier

Access to resources Recommend Favorite