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

Author： Di Puglia Pugliese Luigi Guerriero Francesca

ISSN： 1055-6788

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

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

Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows

By Guerriero F. Di Puglia Pugliese L.

Optimization Methods and Software, Vol. 26, Iss. 2, 2011-04 ,pp. : 295-340

Taylor & Francis Ltd

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

Parallel Asynchronous Algorithms for the K Shortest Paths Problem

By Guerriero F. Musmanno R.

Journal of Optimization Theory and Applications, Vol. 104, Iss. 1, 2000-01 ,pp. : 91-108

Springer Publishing Company

Access to resources Recommend Favorite

Label Correcting Methods to Solve Multicriteria Shortest Path Problems

By Guerriero F. Musmanno R.

Journal of Optimization Theory and Applications, Vol. 111, Iss. 3, 2001-12 ,pp. : 589-613

Springer Publishing Company

Access to resources Recommend Favorite

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