论文信息 - Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance

Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance

The inverse optimization problem is to modify the weight (or cost, length, capacity and so on) such that a given feasible solution becomes an optimal solution. In this paper, we consider the inverse min-max spanning tree problem under the weighted sum-type Hamming distance. For the model considered, we present its combinatorial algorithm that run in strongly polynomial times.

Longcheng Liu | Enyu Yao

[1] Yong He,et al. Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance , 2006, J. Glob. Optim..

[2] Longcheng Liu,et al. A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance , 2007, Asia Pac. J. Oper. Res..

[3] Enyu Yao,et al. Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance , 2005, J. Comb. Optim..

[4] Clemens Heuberger,et al. Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results , 2004, J. Comb. Optim..

[5] Paolo M. Camerini. The Min-Max Spanning Tree Problem and Some Extensions , 1978, Inf. Process. Lett..

[6] Longcheng Liu,et al. Inverse maximum flow problems under the weighted Hamming distance , 2006, J. Comb. Optim..

[7] Xiaoguang Yang,et al. Some New Results on Inverse Sorting Problems , 2005, COCOON.

[8] Yong He,et al. The Center Location Improvement Problem Under the Hamming Distance , 2005, J. Comb. Optim..

[9] Xiaoguang Yang,et al. Some inverse min-max network problems under weighted l1 and l∞ norms with bound constraints on changes , 2006, J. Comb. Optim..