Zhang, Jianzhong, Yang Chao, Lin Yixun. A class of bottleneck expansion problems[J]. Computer & Operations Research, 2001, 28(6): 505-519.
[2]
Zhang Jianzhong, Lin Zhenhong. An oracle strongly polynomial algorithm for bottleneck expansion problems[J]. Optimization Methods and Software, 2001, 17(1): 61-75.
[3]
Burkard R E, Klinz B, Zhang Jianzhong. Bottleneck capacity expansion problem with general budget constraints[J]. RAIRO-Operations Research, 2001, 35: 1-20.
[4]
Yang Chao, Chen Xueqi. An inverse maximum capacity path problem with lower bound constraints[J]. Acta Mathematica Scientia, 2002, 22(2): 207-212.
[5]
Burkard R E, Lin Yixun, Zhang Jianzhong. Weight reduction problems with certain bottleneck objectives[J]. European Journal of Operational Research, 2004, 153(1): 191-199.
[6]
Yang Chao, Hao Chunyan, Zhang Jianzhong. On the optimum capacity of capacity expansion problems[J]. Mathematical Methods of Operations Research, 2007, 66(2): 225-233.
Zhang Jianzhong, Lin Zhenhong, Ma Zhongfan. Some reverse location problems[J]. European Journal of Operational Research, 2000, 124(1): 77-88.
[11]
Wang Qin, Yuan Jinjiang, Zhang Jianzhong. An inverse model for the most uniform problem[J]. Operations Research Letters, 2008, 36(1): 26-30.
[12]
Zhang Jianzhong, Yang Xiaoguang, Cai M C. Inapproximability and a polynomially solvable special case of a network improvement problem[J]. European Journal of Operational Research, 2004, 155(1): 251-257.
[13]
Zhang Jianzhong, Yang Xiaoguang, Cai M C. A network improvement problem under different norms[J]. Computational Optimization and Applications, 2004, 27(3): 305-319.
