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

ISSN： 2040-3607

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

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 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

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

Robust Optimization Strategy for the Shortest Path Problem under Uncertain Link Travel Cost Distribution

COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, Vol. 30, Iss. 6, 2015-06 ,pp. : 433-448

John Wiley & Sons Inc

Access to resources Recommend Favorite

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 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