1. Adelson-velsky, G.M., Levner, E.: Routing information flows in network. A Generalisation of Dijkstra’s Algorithm. Proc. Internat. Conf. “Distributed Communication Networks: Theory and applications”- 1999, Tel Aviv University, pp. 1–4 (1999a)
2. Ahuja, R.K., Magnanti, T. L., Orlin, J.B.: Network Flows. Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs, N. J (1993)
3. Bartusch, M., Mhring, R.H., Radermacher, F.J.: Scheduling Project Networks with Resource Constraints and Time Windows. Ann. Oper. Res. 5(4), 321–344 (1989)
4. Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource constrained Project scheduling: Notation, Classification, Models and Methods. EJOR 112, 3–41 (1999)
5. Chabini, I.: Discrete dynamic shortest path problems in transportation applications, Transportation Research Record 1645 (1998)