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

Citations

Publications citing this paper.
Showing 1-10 of 57 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Cĺımaco. Shortest path problems with partial information: models and algorithms for detecting dominance

  • J.N.L.C. Dias
  • European Journal of Operational Research,
  • 2000
2 Excerpts

Robust Discrete Optimization and its applications

  • P. Kouvelis, G. Yu
  • Kluwer Academic Publishers,
  • 1997
1 Excerpt

A note on two problems in connection with graphs

  • M. CN Pinar O. E. KaraNsan, H. Yaman
  • Numer . Math .
  • 1959

Similar Papers

Loading similar papers…