1. E.J. Anderson, P. Nash, Linear Programming in Infinite-Dimensional Spaces, Wiley, New York, 1987.
2. A class of continuous network flow problems;Anderson;Math. Oper. Res.,1982
3. E.J. Anderson, A.B. Philpott, A continuous-time network simplex algorithm, Networks 19 (1989) 395–425.
4. E.J. Anderson, A.B. Philpott, Optimisation of flows in networks over time, in: F.P. Kelly (Ed.), Probability, Statistics and Optimisation, Ch. 27, Wiley, New York, 1994, pp. 369–382.
5. A survey of dynamic network flows;Aronson;Ann. Oper. Res.,1989