Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights

DOI10.1007/978-3-642-35261-4_61zbMath1260.90115OpenAlexW2274566957MaRDI QIDQ4909575

Tsunehiko Kameda, Zhao Song, Binay K. Bhattacharya

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_61

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

Minmax regret 1-facility location on uncertain path networks ⋮ The \(p\)-center problem under locational uncertainty of demand points ⋮ A linear time algorithm for computing minmax regret 1-median on a tree network

This page was built for publication: Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights