Inverse vertex obnoxious center location problems on networks
Publish Year: 1398
نوع سند: مقاله کنفرانسی
زبان: English
View: 402
This Paper With 5 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICIORS12_068
تاریخ نمایه سازی: 24 شهریور 1398
Abstract:
In an inverse vertex obnoxious center location problem, the aim is to modify the edge lengths at minimum total cost with respect to the modification bounds such that a predetermined vertex becomes a vertex obnoxious center location under the new edge lengths. We develop a linear time combinatorial method for the problem with edge length augmentation. For the reduction case, an algorithm with cubic running time is devised
Keywords:
Authors
Roghayeh Etemad
Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology,Tabriz, Iran
Behrooz Alizadeh
Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran