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

Roberto Montemanni, Luca Maria Gambardella, Alberto V. Donati. A branch and bound algorithm for the robust shortest path problem with interval data. Oper. Res. Lett., 32(3):225-232, 2004. [doi]

@article{MontemanniGD04,
  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},
  year = {2004},
  doi = {10.1016/j.orl.2003.08.002},
  url = {http://dx.doi.org/10.1016/j.orl.2003.08.002},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/MontemanniGD04},
  cites = {0},
  citedby = {0},
  journal = {Oper. Res. Lett.},
  volume = {32},
  number = {3},
  pages = {225-232},
}