مرکز منطقه ای اطلاع رساني علوم و فناوري - The computational complexity of the relative robust shortest path problem with interval data

Title of article :

The computational complexity of the relative robust shortest path problem with interval data

Author/Authors :

Pawe Zieli?ski، نويسنده ,

Issue Information :

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

Pages :

From page :

570

To page :

576

Keywords :

robust optimization , Shortest path problem , computational complexity , Combinatorial optimization , Interval data

Journal title :

European Journal of Operational Research

Serial Year :

2004

Journal title :

European Journal of Operational Research

Record number :

215097

Link To Document :