Generalized path-finding algorithms on semirings and the fuzzy shortest path problem

Author： Boulmakoul A.  

Publisher： Elsevier

ISSN： 0377-0427

Source： Journal of Computational and Applied Mathematics, Vol.162, Iss.1, 2004-01, pp. : 263-272

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 shortest path problem on a network with fuzzy arc lengths

By Okada S.   Soper T.  

Fuzzy Sets and Systems, Vol. 109, Iss. 1, 2000-01 ,pp. : 129-140

Elsevier

Access to resources Recommend Favorite

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

By Ramalingam G.   Reps T.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 267-305

Academic Press

Access to resources Recommend Favorite

Dynamic programming approaches to solve the shortest path problem with forbidden paths

By Di Puglia Pugliese Luigi   Guerriero Francesca  

Optimization Methods and Software, Vol. 28, Iss. 2, 2013-04 ,pp. : 221-255

Taylor & Francis Ltd

Access to resources Recommend Favorite

A branch and bound algorithm for the robust shortest path problem with interval data

By Montemanni R.   Gambardella L.M.   Donati A.V.  

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 225-232

Elsevier

Access to resources Recommend Favorite

A note on different modelling approaches for the robust shortest path problem

By Nikulin Yury  

International Journal of Mathematical Modelling and Numerical Optimisation, Vol. 3, Iss. 3, 2012-07 ,pp. : 141-157

Inderscience Publishers

Access to resources Recommend Favorite