A minmax regret median problem on a tree under uncertain locations of the demand points

DOI10.1016/j.orl.2013.08.002zbMath1287.90028OpenAlexW2010668757MaRDI QIDQ2450737

Eduardo Conde

Publication date: 15 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2013.08.002

zbMATH Keywords

locationrobustness and sensitivity analysisminmax-regret models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
• A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
• Lexicographicα-robustness: an application to the 1-median problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Minmax-regret robust 1-median location on a tree
• An improved algorithm for the minmax regret median problem on a tree
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: A minmax regret median problem on a tree under uncertain locations of the demand points