On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2012.01.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1966509452
@@ Property / OpenAlex ID: W1966509452 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max and min-max regret assignment problems
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+Complexity of robust single facility location problems on networks with uncertain edge lengths.
+Normal rank
@@ Property / cites work @@
+Minmax regret linear resource allocation problems.
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the minmax regret median problem on a tree
+Normal rank
@@ Property / cites work @@
+On the complexity of minmax regret linear programming
+Normal rank
@@ Property / cites work @@
+The computational complexity of the criticality problems in a network with interval activity times
+Normal rank
@@ Property / cites work @@
+Q4079613
@@ Property / cites work: Q4079613 / rank @@
+Normal rank
@@ Property / cites work @@
+A minmax regret approach to the critical path method with task interval times
+Normal rank
@@ Property / cites work @@
+A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
+Normal rank
@@ Property / cites work @@
+Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
+Normal rank
@@ Property / cites work @@
+Some tractable instances of interval data minmax regret problems
+Normal rank
@@ Property / cites work @@
+Discrete optimization with interval data. Minmax regret and fuzzy approach
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
+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 @@
+Complexity of minimizing the total flow time with interval data and minmax regret criterion
+Normal rank
@@ Property / cites work @@
+A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
+Normal rank
@@ Property / cites work @@
+A Benders decomposition approach for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem with interval data via Benders decomposition
+Normal rank
@@ Property / cites work @@
+Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank