A branch and bound algorithm for the robust shortest path problem with interval data |
| |
| Authors: | R. Montemanni L.M. Gambardella |
| |
| Affiliation: | Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928 Manno, Switzerland |
| |
| Abstract: | 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. |
| |
| Keywords: | Branch and bound Shortest path problem Robust optimization Interval data |
| 本文献已被 ScienceDirect 等数据库收录！ |
