Cite

HARVARD Citation

    Lacomme, P. et al. (n.d.). A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution. Engineering applications of artificial intelligence. pp. 75-86. [Online]. 
  
Back to record