Minmax-regret robust 1-median location on a tree

DOI<93::AID-NET4>3.0.CO;2-E 10.1002/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-EzbMath0930.90050OpenAlexW1970531677MaRDI QIDQ4260015

Bintong Chen, Chin-Shien Lin

Publication date: 7 September 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199803)31:2<93::aid-net4>3.0.co;2-e

zbMATH Keywords

uncertaintytree networkminmax-regret 1-median problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (28)

Minmax regret 1-facility location on uncertain path networks ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ 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 ⋮ Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria ⋮ The minmax regret gradual covering location problem on a network with incomplete information of demand weights ⋮ 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 ⋮ Ambulance Emergency Response Optimization in Developing Countries ⋮ A linear time algorithm for computing minmax regret 1-median on a tree network ⋮ Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ Robust location problems with pos/neg weights on a tree ⋮ Facility location problems with uncertainty on the plane ⋮ The backup 2‐center and backup 2‐median problems on trees ⋮ Capacitated multi-period maximal covering location problem with server uncertainty ⋮ Minimax regret 1-median problem in dynamic path networks ⋮ Robust absolute single machine makespan scheduling-location problem on trees ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Complexity of robust single facility location problems on networks with uncertain edge lengths. ⋮ Algorithms for the robust 1-center problem on a tree ⋮ Robust placement of sensors in dynamic water distribution systems ⋮ Minmax regret solutions for minimax optimization problems with uncertainty ⋮ Minimax regret 1-sink location problem in dynamic path networks ⋮ On the minmax regret path median problem on trees ⋮ Backup multifacility location problem with \(l_p\) norm

This page was built for publication: Minmax-regret robust 1-median location on a tree