1. Ahuja, R. K., T. L. Magnanti, and J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications, Prentice Hall, NJ.
2. Ahuja, R. K., and J. B. Orlin. 1997. A fast algorithm for the bipartite node weighted matching on path graphs with application to the inverse spanning tree problem. Working Paper, Sloan School of Management, MIT, Cambridge, MA.
3. Barlow, R. E., D. J. Bartholomew, D. J. Bremner, and H. D. Brunk. 1972. Statistical Inference under Order Restrictions. Wiley, New York.
4. Bertsekas, D. P. 1979. A distributed algorithm for the assignment problem. Working Paper, Laboratory for Information and Decision Sciences, MIT, Cambridge, MA.
5. Boros, E., and R. Shamir. 1991. Convex separable minimization over partial order constraints. Report No. RRR 27-91, RUTCOR, Rutgers University, New Brunswick, NJ.