A minmax regret median problem on a tree under uncertain locations of the demand points (Q2450737): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2013.08.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2010668757
@@ Property / OpenAlex ID: W2010668757 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the minmax regret median problem on a tree
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
+Normal rank
@@ Property / cites work @@
+An O\((n\log n)\) version of the Averbakh-Berman algorithm for the robust median of a tree
+Normal rank
@@ Property / cites work @@
+Minmax-regret robust 1-median location on a tree
@@ Property / cites work: Minmax-regret robust 1-median location on a tree / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
+Normal rank
@@ Property / cites work @@
+Lexicographic<i>α</i>-robustness: an application to the 1-median problem
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2450737