A note on the minmax regret centdian location on trees (Q935247): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2007.05.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2063535497
@@ Property / OpenAlex ID: W2063535497 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimax regret p-center location on a network with demand uncertainty
+Normal rank
@@ Property / cites work @@
+Algorithms for the robust 1-center problem on a tree
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the minmax regret median problem on a tree
+Normal rank
@@ Property / cites work @@
+Multicriteria network location problems with sum objectives
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for thep-centdian problem on a tree
+Normal rank