Minmax regret linear resource allocation problems. (Q1417598): Difference between revisions

@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+On the complexity of minmax regret linear programming
+Normal rank
@@ Property / cites work @@
+Robust Convex Optimization
@@ Property / cites work: Robust Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4286721
@@ Property / cites work: Q4286721 / rank @@
+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 @@
+Robust Optimization of Large-Scale Systems
@@ Property / cites work: Robust Optimization of Large-Scale Systems / rank @@
+Normal rank
@@ Property / cites work @@
+The robust spanning tree problem with interval data
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(03)00091-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2046217872
@@ Property / OpenAlex ID: W2046217872 / rank @@
+Normal rank