1. Adler, I., Resende, M. G. C., Veiga, G.: An implementation of Karmarkar’s algorithm for linear programming. Math. Prog. 44 (1989) 297–335
2. Andersen, E. D., Andersen, K. D.: A parallel interior-point algorithm for linear programming on a shared memory machine. CORE Discussion Paper 9808 (1998), CORE, Louvain-La-Neuve, Belgium
3. Bertsekas, D. P., Tsitsiklis, J. N.: Parallel and Distributed Computation. Prentice-Hall, Englewood Cliffs (1995)
4. Bienstock D.: Approximately solving large-scale linear programs. I: Strengthening lower bounds and accelerating convergence. CORC Report 1999-1 (1999), Columbia University, NY
5. Castro, J.: A specialized interior-point algorithm for multicommodity network flows. SIAM J. on Opt. 10(3) (2000) 852–877