论文信息 - An inverse Maximum capacity path problem with lower bound constraints

An inverse Maximum capacity path problem with lower bound constraints

Abstract The computational complexity of inverse mimimum capacity path problem with lower bound on capacity of maximum capacity path is examined, and it is proved that solution of this problem is NP-complete. A strong polynomial algorithm for a local optimal solution is provided.

Chao Yang | Xueqi Chen

[1] Jianzhon Zhang,et al. Inverse maximum capacity problems , 1998 .

[2] Jianzhon Zhang,et al. An inverse problem of the weighted shortest path problem , 1995 .

[3] Zhenhong Liu,et al. On the inverse problem of minimum spanning tree with partition constraints , 1996, Math. Methods Oper. Res..

[4] Philippe L. Toint,et al. On an instance of the inverse shortest paths problem , 1992, Math. Program..

[5] Chao Yang,et al. A column generation method for inverse shortest path problems , 1995, Math. Methods Oper. Res..

[6] Kaj Madsen,et al. Optimization of pipe networks , 1991, Math. Program..

[7] Chao Yang,et al. A constrained capacity expansion problem on networks , 1998, Int. J. Comput. Math..