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

Author： Montemanni R.   Gambardella L.M.   Donati A.V.  

Publisher： Elsevier

ISSN： 0167-6377

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

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

Related content

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

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

A Branch-and-Cut Algorithm for the Median-Path Problem

By Avella Pasquale   Boccia Maurizio   Sforza Antonio   Vasil'Ev Igor  

Computational Optimization and Applications, Vol. 32, Iss. 3, 2005-12 ,pp. : 215-230

Springer Publishing Company

Access to resources Recommend Favorite

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

By  

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

Worst Case Bounds for Shortest Path Interval Routing

By Gavoille C.   Guevremont E.  

Journal of Algorithms, Vol. 27, Iss. 1, 1998-04 ,pp. : 1-25

Academic Press

Access to resources Recommend Favorite