1. Network Flows;Ahuja,1993
2. Dual algorithms for pure network problems;Ali;Operations Research,1989
3. Operation Research;Hira,1994
4. J.B. Orlin, Genuinely polynomial simplex and non-simplex algorithms for minimum cost problems, Technical Report 1615-84, Sloan School of Management, MIT, Cambridge, MA, 1984
5. Improved dual network simplex;Plotkin,1990