Combinatorial Algorithms for Reverse Selective Undesirable Center Location Problems on Cycle Graphs

作     者：Roghayeh Etemad Behrooz Alizadeh 

作者机构：Department of Applied MathematicsFaculty of Basic SciencesSahand University of TechnologyTabrizIran 

出 版 物：《Journal of the Operations Research Society of China》 (中国运筹学会会刊（英文）)

年 卷 期：2017年第5卷第3期

页      面：347-361页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：the Sahand University of Technology under the Ph.D.program contract(No.30/15971) 

主　　题：Undesirable center location Reverse optimization Combinatorial optimization Time complexity 

摘      要：This paper deals with a general variant of the reverse undesirable(obnoxious)center location problem on cycle *** a‘selective’subset of the vertices of the underlying cycle graph as location of the existing customers,the task is to modify the edge lengths within a given budget such that the minimum of distances between a predetermined undesirable facility location and the customer points is maximized under the perturbed edge *** develop a combinatorial O(n log n)algorithm for the problem with continuous *** the uniform-cost model,we solve this problem in linear time by an improved ***,exact solution methods are proposed for the problem with integer modifications.