مرکز منطقه ای اطلاع رساني علوم و فناوري - A branch and bound algorithm for the robust shortest path problem with interval data

Title of article :

A branch and bound algorithm for the robust shortest path problem with interval data

Author/Authors :

R. Montemanni، نويسنده , , L. M. Gambardella، نويسنده , , A. V. Donati، نويسنده ,

Issue Information :

دوماهنامه با شماره پیاپی سال 2004

Pages :

From page :

225

To page :

232

Keywords :

branch and bound , Shortest path problem , Interval data , robust optimization

Journal title :

Operations Research Letters

Serial Year :

2004

Journal title :

Operations Research Letters

Record number :

137501

Link To Document :