[1]Burton D, Toint Ph L. On an instance of the inverse shortest paths problem. Mathematical Programming,1992,52:45-61

[2]Zhang J, Ma Z, Yang C. A column generation method for inverse shortest path problem. Zeitschrift fur Operations Research, 1995,41:347-358

[3]Xu S, Zhang J. An inverse problem of the weighted shortest path problem. Japan Journal of Industrialand Applied Mathematics, 1995,12: 47-60

[4]Zhang J, Liu Z, Ma Z. On the inverse problem of minimum spanning tree with partition constraints.Zeitschrift f¨ur Operations Research, 1996,44:171-187

[5]Cai Maocheng. An inverse problem of matrid intersection(Submitted)

[6]Burton D, Pulleyblank B, Toint Ph L. The inverse shortest path problem with upper bounds on shortest path costs. In: Pardalos P, et al eds. Network Optimization. Lecture Note in Economics and Mathematics Systems, 1997,450:156-171

[7]Yang C, Zhang J. Inverse maximum capacity Problem. OR Spektrum, 1988,20:97-100

[8]Yang C, Zhang J. A Constrained Capacity Expansion Problem on Networks. International Journal of computer Mathematics, 1998,70: 19-33