Minimax regret vertex 2-sink location problem in dynamic path networks

Hongmei Li, Yinfeng Xu () and Guanqun Ni
Additional contact information
Hongmei Li: Sichuan University
Yinfeng Xu: Sichuan University
Guanqun Ni: Sichuan University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 8, 79-94

Abstract: Abstract This paper considers the minimax regret vertex 2-sink location problem in a dynamic path network with positive edge lengths and uniform edge capacity. Let $$P$$ P be an undirected path graph of $$n$$ n vertices, and the weight (initial supply) of every vertex is known as an interval. The problem is to find two vertices $$x$$ x and $$y$$ y as two sinks on the path such that all the weights can evacuate to $$x$$ x and $$y$$ y with minimum regret of evacuation time in case of an emergency for any possible weight distribution. We present an $$O(n^3\log n)$$ O ( n 3 log n ) time algorithm.

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

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9716-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9716-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9716-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().