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. 225-232 2004 32 Oper. Res. Lett. 3 http://dx.doi.org/10.1016/j.orl.2003.08.002 db/journals/orl/orl32.html#MontemanniGD04