An improved algorithm for the minmax regret median problem on a tree
From MaRDI portal
Publication:4804168
DOI10.1002/net.10062zbMath1028.90081OpenAlexW2017571998MaRDI QIDQ4804168
Publication date: 10 April 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10062
Minimax problems in mathematical programming (90C47) Graph theory (including graph drawing) in computer science (68R10)
Related Items (20)
Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Minmax regret 1-facility location on uncertain path networks ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Minmax regret location--allocation problem on a network under uncertainty ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ The minmax regret gradual covering location problem on a network with incomplete information of demand weights ⋮ Location Science in Canada ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree ⋮ A minmax regret median problem on a tree under uncertain locations of the demand points ⋮ A note on the minmax regret centdian location on trees ⋮ A linear time algorithm for computing minmax regret 1-median on a tree network ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ The backup 2‐center and backup 2‐median problems on trees ⋮ On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems ⋮ Minimax regret path location on trees ⋮ On the minmax regret path median problem on trees
Cites Work
This page was built for publication: An improved algorithm for the minmax regret median problem on a tree
