1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms and Applications (Prentice Hall, New York, NY, 1993).
2. R.G. Bland and D.L. Jensen, On the computational behavior of a polynomial-time network flow algorithm,Mathematical Programming 54 (1992) 1–41.
3. M. Burlet and A.V. Karzanov, Minimum weight (T, d)-joins and multi-joins, Research Report RR 929-M- (IMAG ARTEMIS, Grenoble, 1993) 15 p.; to appear inDiscrete Mathematics (1997).
4. B.V. Cherkassky, A solution of a problem on multicommodity flows in a network,Ekonomika i Matematicheskie Metody 13 (1) (1977) 143–151 (in Russian).
5. W. Cunningham and J. Green-Krotki, Dominants and submissives of matching polyhedra,Mathematical Programming 36 (1986) 228–237.