Highly Influenced

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

@article{Montemanni2004ABA, title={A branch and bound algorithm for the robust shortest path problem with interval data}, author={Roberto Montemanni and Luca Maria Gambardella and Alberto V. Donati}, journal={Oper. Res. Lett.}, year={2004}, volume={32}, pages={225-232} }

- Published 2004 in Oper. Res. Lett.
DOI:10.1016/j.orl.2003.08.002

Many real problems in transportation and telecommunications can be modelled in mathematical terms as shortest path problems on interval digraphs, where an interval cost is associated with each arc. Intervals represent uncertainty, typical of real situations, about the exact values of costs. A robust shortest path is a path which is not too far from the best one, whatever the exact values of arc costs are. This criterion, expressed in mathematical terms, is used to drive optimization. A branchâ€¦Â CONTINUE READING