首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The partial inverse minimum spanning tree problem when weight increase is forbidden
Authors:Mao-Cheng Cai  CW Duin  Xiaoguang Yang  Jianzhong Zhang
Institution:1. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080, PR China;2. Department of Operations Research, Faculty of Economic Science and Econometrics, University of Amsterdam, The Netherlands;3. Department of System Engineering and Engineering Management, The Chinese University of Hong Kong, Hong Kong, China
Abstract:In a partial inverse optimization problem there is an underlying optimization problem with a partially given solution. The objective is to find a minimal perturbation of some of the problem’s parameter values, in such a way that the partial solution becomes a part of the optimal solution.
Keywords:Partial inverse problem  Spanning tree  Weight reduction  Polynomial time algorithms
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号