A Multiple-Starting-Path Approach to the Resource-Constrained th Elementary Shortest Path Problem

Procedure 1

Procedure  

;

  ;

  ;

Repeat

   un-extended state

    if the extension of to is feasible

       ;

       ;

       ;

  mark as the extended state;

Until  there is no un-extended state in ,

Return  ;