1. S. Agmon, “The relaxation method for linear inequalities,”Canadian Journal of Mathematics 6 (1954) 382–392.
2. I. Ali, “Two node-routing problems,” unpublished dissertation, Department of Operations Research, Southern Methodist University (Dallas, Texas, 1980).
3. I. Ali and J. Kennington, “The asymmetricM-travelling salesman problem: A duality based branch-and-bound algorithm,”Discrete Applied Mathematics 13 (1986) 259–276.
4. Technical Report 85-OR-1;I. Ali,1980
5. E. Allen, “Using two sequences of pure network problems to solve the multicommodity network flow problem,” unpublished dissertation, Department of Operations Research, Southern Methodist University, Dallas, Texas (1985).