| Article ID: | iaor20043358 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 3 |
| Start Page Number: | 225 |
| End Page Number: | 232 |
| Publication Date: | May 2004 |
| Journal: | Operations Research Letters |
| Authors: | Gambardella L.M., Montemanni R., Donati A.V. |
| Keywords: | networks: path, programming: branch and bound |
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs. A branch and bound algorithm for this problem is presented.