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.
A branch and bound algorithm for the robust shortest path problem with interval data / Montemanni, Roberto; Gambardella Luca, Maria; Donati Alberto, V. - In: OPERATIONS RESEARCH LETTERS. - ISSN 0167-6377. - 32:3(2004), pp. 225-232. [10.1016/j.orl.2003.08.002]
A branch and bound algorithm for the robust shortest path problem with interval data
Montemanni Roberto;
2004
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.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
