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 条
12345