Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible conflguration of the arc costs. A Benders decomposition approach for this problem is presented.
A Benders decomposition approach for the robust shortest path problem with interval data / Montemanni, R; Gambardella, Lm. - (2005). (Intervento presentato al convegno The International Network Optimization Conference 2005 tenutosi a Lisbon nel March 2005).