Shortest paths in a network with time-dependent flow speeds

Author： Sung K. Bell M.G.H. Seong M. Park S.

Publisher： Elsevier

ISSN： 0377-2217

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

Time-Dependent and Flow Properties of Foams

By Bekkour K. Scrivener O.

Mechanics of Time-Dependent Materials, Vol. 2, Iss. 2, 1998-01 ,pp. : 171-193

Springer Publishing Company

Access to resources Recommend Favorite

Asymptotic optimality of shortest processing time-based algorithms for flow shop and open shop problems with nonlinear objective functions

By Bai Danyu Zhang Zhihai

Engineering Optimization, Vol. 46, Iss. 12, 2014-12 ,pp. : 1709-1728

Taylor & Francis Ltd

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