مرکز منطقه ای اطلاع رساني علوم و فناوري - Finding K shortest looping paths with waiting time in a time

Title of article :

Finding K shortest looping paths with waiting time in a time–window network

Author/Authors :

Hsu-Hao Yang and Yen-Liang Chen، نويسنده ,

Issue Information :

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

Pages :

From page :

458

To page :

465

Keywords :

Shortest looping path , Time–window

Journal title :

Applied Mathematical Modelling

Serial Year :

2006

Journal title :

Applied Mathematical Modelling

Record number :

296083

Link To Document :