Volume 8, Issue 3 (Vol. 8,No. 3, 2022)                   mmr 2022, 8(3): 15-26 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
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
The robust vertex centdian location problem with interval vertex weights on general graphs
Nazanin Eskandari Arjomand1 , Fahimeh Baroughi *2 , Soudabeh Seyyedi Gomi1 , Behrooz Alizadeh1
1- Sahand University of Technology
2- Sahand University of Technology , baroughi@sut.ac.ir
Abstract:   (1437 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.
Keywords: Centdian location problem, Min-max regret criterion, Robust optimization.
Full-Text [PDF 1150 kb]   (658 Downloads)    
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
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2025 CC BY-NC 4.0 | Mathematical Researches

Designed & Developed by : Yektaweb