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

The partial sum criterion for Steiner trees in graphs and shortest paths

By Duin C.W.   Volgenant A.  

European Journal of Operational Research, Vol. 97, Iss. 1, 1997-02 ,pp. : 172-182

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

An (s,&unknown;S) random lifetime inventory model with a positive lead time

By Liu L.   Yang T.  

European Journal of Operational Research, Vol. 113, Iss. 1, 1999-02 ,pp. : 52-63

Elsevier

Access to resources Recommend Favorite