1. I. Adler and S. Cosares, “A strongly polynomial algorithm for a special class of linear programs,”Operations Research 39 (1991) 955–960.
2. E. Cohen, “Combinatorial Algorithms for optimization problems PhD thesis, Department of Computer Science, Stanford University, Stanford, Ca, 1991.
3. E. Cohen and N. Megiddo, “Improved algorithms for linear inequalities with two variables per inequality,” in:Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (ACM, New York, 1991) 145–155.
4. E. Cohen and N. Megiddo, “New algorithms for generalized network flows,” in: D. Dolev, Z. Galil and M. Rodeh, eds.,Proceedings of the 1st Israeli Symposium on the Theory of Computing and Systems, Lecture Notes in Computer Science Vol. 601 (Springer-Verlag, Berlin, 1992) 103–114.
5. E. Cohen and N. Megiddo, “Improved algorithms for linear inequalities with two variables per inequality,”SIAM Journal on Computing (1993) to appear.