Inverse min-max spanning tree problem under the weighted sum-type hamming distance

被引:0
|
作者
Liu, Longcheng [1 ]
Yao, Enyu [1 ]
机构
[1] Zhejiang Univ, Dept Math, Hangzhou 310027, Peoples R China
来源
COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES | 2007年 / 4614卷
基金
中国国家自然科学基金;
关键词
min-max spanning tree; inverse problem; hamming distance; strongly polynomial algorithms;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:375 / +
页数:2
相关论文
共 50 条
  • [21] Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
    Wang, Hui
    Guan, Xiucui
    Zhang, Qiao
    Zhang, Binwu
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (04) : 861 - 887
  • [22] Multiclass classification by Min-Max ECOC with Hamming distance optimization
    Szucs, Gabor
    VISUAL COMPUTER, 2023, 39 (09): : 3949 - 3961
  • [23] A weighted inverse minimum cut problem under the bottleneck type hamming distance
    Liu, Longcheng
    Yao, Enyu
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2007, 24 (05) : 725 - 736
  • [24] Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
    Zhang, BW
    Zhang, JH
    He, Y
    JOURNAL OF GLOBAL OPTIMIZATION, 2006, 34 (03) : 467 - 474
  • [25] Constrained Inverse Minimum Spanning Tree Problems under the Bottleneck-Type Hamming Distance
    Binwu Zhang
    Jianzhong Zhang
    Yong He
    Journal of Global Optimization, 2006, 34 : 467 - 474
  • [26] Inverse max plus sum spanning tree problem under weighted l1 norm by modifying the sum-cost vector
    Guan, Xiucui
    Pardalos, Panos M.
    Zhang, Binwu
    OPTIMIZATION LETTERS, 2018, 12 (05) : 1065 - 1077
  • [27] The Partitioning Min-Max Weighted Matching Problem
    Kress, Dominik
    Meiswinkel, Sebastian
    Pesch, Erwin
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 247 (03) : 745 - 754
  • [28] Spanning Tree Based Community Detection using Min-Max Modularity
    Behera, Ranjan Kumar
    Rath, S. K.
    Jena, Monalisa
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING AND COMMUNICATIONS, 2016, 93 : 1070 - 1076
  • [29] Inverse 1-median problem on trees under weighted Hamming distance
    Guan, Xiucui
    Zhang, Binwu
    JOURNAL OF GLOBAL OPTIMIZATION, 2012, 54 (01) : 75 - 82
  • [30] Inverse 1-median problem on trees under weighted Hamming distance
    Xiucui Guan
    Binwu Zhang
    Journal of Global Optimization, 2012, 54 : 75 - 82