Eskandari Arjomand N, Baroughi F, Seyyedi Gomi S, Alizadeh B. The robust vertex centdian location problem with interval vertex weights on general graphs. mmr 2022; 8 (3) :15-26
URL:
http://mmr.khu.ac.ir/article-1-3100-en.html
1- Sahand University of Technology
2- Sahand University of Technology , baroughi@sut.ac.ir
Abstract: (657 Views)
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs is solved in cubic time.
Type of Study:
Research Paper |
Subject:
Mat Received: 2020/06/12 | Revised: 2023/06/17 | Accepted: 2021/01/31 | Published: 2022/12/20 | ePublished: 2022/12/20