|
The robust vertex centdian location problem with interval vertex weights on general graphs
|
| Nazanin Eskandari Arjomand1, Fahimeh Baroughi2, Soudabeh Seyyedi Gomi1, Behrooz Alizadeh1 |
1- Sahand University of Technology
2- Sahand University of Technology , baroughi@sut.ac.ir |
|
|
Abstract: (114 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]
(42 Downloads)
|
Type of Study: Research Paper |
Subject:
Mat
Received: 2020/06/12 | Revised: 2022/12/20 | Accepted: 2021/01/31 | Published: 2022/12/20 | ePublished: 2022/12/20
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
