1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin,Network flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. R. K. Ahuja and J. B. Orlin,A Faster Algorithm for the Inverse Spanning Tree Problem, Journal of Algorithms34 (2000), 177–193.
3. R. K. Ahuja and J. B. Orlin,Combinatorial Algorithms for Inverse Network Flow Problems, Sloan School of Management, MIT, Cambridge, MA, sent for publication, 1998.
4. R. K. Ahuja and J. B. Orlin,Inverse Optimization, Working Paper, Sloan School of Management, MIT, Cambridge, MA, 1998.
5. D. Burton, B. Paulleyblank and Ph. L. Toint,The inverse shortest paths problem with upper bounds on shortest paths costs, Network Optimization (P. Pardalos, D. W. Hearn and W. H. Harger), Lecture Notes in Econom, Math. Systems, vol. 450, pp. 156–171, Springer-Verlang, Berlin/New York, 1997.