The Minimax-regret spanning tree problem(最小最大后悔支撑树问题)
本文建立了最小最大后悔支撑树问题的模型.利用划分问题,证明了该问题是NP-C的.然后利用两个已有的算法,给出了上下界估计.最后对一种特殊情况,给出了一个启发式算法,并证明了其性能比是紧的.
Main Authors: | LIBang-yi(李帮义), YAOEn-yu(姚恩瑜) |
---|---|
Format: | Article |
Language: | zho |
Published: |
Zhejiang University Press
2001-05-01
|
Series: | Zhejiang Daxue xuebao. Lixue ban |
Subjects: | |
Online Access: | https://doi.org/zjup/1008-9497.2001.28.3.237-242 |
Similar Items
-
Study on the Problem of Constrained Minimum Spanning Tree(约束最小生成树问题研究)
by: CHENGuang-ting(陈光亭), et al.
Published: (1999-01-01) -
Network flow problem with carrier(带运输工具的网络流问题)
by: LEITing(雷挺), et al.
Published: (2007-05-01) -
The Flow Shop problem with a server(带服务器的Flow Shop问题)
by: SUChun-jie(苏纯洁), et al.
Published: (2000-07-01) -
Dynamic minimum cost path problem with curfews(带有宵禁限制的动态最短费用路问题)
by: HECai-xiang(何彩香), et al.
Published: (2008-07-01) -
平行光束反射式光纤位移传感器双值问题研究
by: 李丽君, et al.
Published: (2010-01-01)