A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max and min-max regret assignment problems
+Normal rank
@@ Property / cites work @@
+Approximation of min-max and min-max regret versions of some combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max (regret) versions of min cut problems
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+On the complexity of minmax regret linear programming
+Normal rank
@@ Property / cites work @@
+Q3182207
@@ Property / cites work: Q3182207 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust optimization-methodology and applications
@@ Property / cites work: Robust optimization-methodology and applications / rank @@
+Normal rank
@@ Property / cites work @@
+On a constant factor approximation for minmax regret problems using a symmetry point scenario
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+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 @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+A Benders decomposition approach for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust shortest path problem with interval data.
+Normal rank
@@ Property / cites work @@
+A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
+Normal rank
@@ Property / cites work @@
+A quick method for finding shortest pairs of disjoint paths
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank