Minimax regret vertex centdian location problem in general dynamic networks

Hongmei Li, Taibo Luo, Yinfeng Xu and Jiuping Xu

Omega, 2018, vol. 75, issue C, 87-96

Abstract: In this paper, we consider the minimax regret centdian location problem in general dynamic networks with positive edge lengths and interval vertex weights, where the centdian point should be located on a vertex only. Let G=(V,E) be an undirected connected simple graph with n vertices. Each vertex has a weight that is not known precisely, but the interval to which it belongs is given. A particular assignment of a weight to each vertex is called a scenario. The problem requires that a vertex x should be determined as the minimax regret centdian on the graph, such that the maximum regret of the objective function for all possible scenarios is minimized. We present an O(n3log n) time algorithm for solving this problem. Several computational experiments are also discussed.

Keywords: Centdian location; General network; Minimax regret; Algorithm (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048316304935
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:75:y:2018:i:c:p:87-96

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2017.02.004

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().