Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2010.03.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2074338624
@@ Property / OpenAlex ID: W2074338624 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of the min-max and min-max regret assignment problems
+Normal rank
@@ Property / cites work @@
+On the complexity of the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Minmax regret solutions for minimax optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
+Normal rank
@@ Property / cites work @@
+On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
+Normal rank
@@ Property / cites work @@
+Minimax regret spanning arborescences under uncertain costs
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+The robust shortest path problem in series -- parallel multidigraphs with interval data
+Normal rank
@@ Property / cites work @@
+On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
+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 @@
+A branch and bound algorithm for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+A Benders decomposition approach for the robust spanning tree problem with interval data
+Normal rank
@@ Property / cites work @@
+Restricted robust uniform matroid maximization under interval uncertainty
+Normal rank
@@ Property / cites work @@
+The computational complexity of the relative robust shortest path problem with interval data
+Normal rank
@@ Property / cites work @@
+Robust Convex Optimization
@@ Property / cites work: Robust Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and network flows
@@ Property / cites work: Robust discrete optimization and network flows / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Solutions to Uncertain Semidefinite Programs
+Normal rank
@@ Property / cites work @@
+Robust Optimization of Large-Scale Systems
@@ Property / cites work: Robust Optimization of Large-Scale Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
+Normal rank
@@ Property / cites work @@
+Q4111952
@@ Property / cites work: Q4111952 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank