1. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. (1993). Network Flows: Theory, Algorithms and Applications. Prentice Hall. Chapter 18: Computational Testing of Algorthms.
2. Alizadeh, F. and Goldberg, A.V. (1993). Implementing the push-relabel method for the maximum flow problem on a connection machine. In Network Flows and Matching: First DIMACS Implementation Challenge. American Mathematical Society. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 12.
3. Anderson, R.J. (1997). The role of experiment in the theory of algorithms. Position paper, to appear in Proceedings of the Fifth DIMACS Challenge. Available at
http://www.cs.washington.edu
/homes/anderson/papers/method.ps.
4. Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., and Stewart, W.R. (1995). Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1 (1): 9–32.
5. Beardwood, J., Halton, J.H., and Hammersley, J.M. (1959). The shortest path through many points. Proceedings of the Cambridge Philosophical Society, 55:299–327.