1. Burton D, Toint PhL (1992) On an instance of the inverse shortest paths problem. Mathematical Programming 53:45?61
2. Cai M, Yang X (1995) Inverse shortest path problems. Proc. Internat. Symp. on Operations Research with Applications in Technology and Management, ISORA'95, Beijing: 242?248
3. Ford LR, Fulkerson DR (1962) Flows in Networks. Princeton University Press, Princeton, N.J.
4. Frank A (1981) A weighted matroid intersection algorithm. J. Algorithms 2:328?336
5. Hu Z, Liu Z (1994) A strongly polynomial algorithm for the inverse shortest arborescence problem. Working paper, Institute of Systems Science, Academia Sinica, Beijing, China