مرکز منطقه ای اطلاع رساني علوم و فناوري - The robust shortest path problem in series–parallel multidigraphs with interval data

Title of article :

The robust shortest path problem in series–parallel multidigraphs with interval data

Author/Authors :

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

Issue Information :

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

Pages :

From page :

To page :

Keywords :

Robust optimization , Pseudopolynomial algorithm , Shortest path problem , combinatorial optimization , NP-hardness

Journal title :

Operations Research Letters

Serial Year :

2006

Journal title :

Operations Research Letters

Record number :

137657

Link To Document :