Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function

Author： Murthy I.   Sarkar S.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.103, Iss.1, 1997-11, pp. : 209-229

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

Dynamic shortest path in stochastic dynamic networks: Ship routing problem

By Azaron A.   Kianfar F.  

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

Elsevier

Access to resources Recommend Favorite

A penalty function heuristic for the resource constrained shortest path problem

By Avella P.   Boccia M.   Sforza A.  

European Journal of Operational Research, Vol. 142, Iss. 2, 2002-10 ,pp. : 221-230

Elsevier

Access to resources Recommend Favorite

Shortest path problems with partial information: Models and algorithms for detecting dominance

By Dias L.C.   Clmaco J.N.  

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

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 interactive analysis of the multicriteria shortest path problem by the reference point method

By Granat J.   Guerriero F.  

European Journal of Operational Research, Vol. 151, Iss. 1, 2003-11 ,pp. : 103-118

Elsevier

Access to resources Recommend Favorite