On the complexity of minmax regret linear programming (Q1887882): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2003.07.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2089510325
@@ Property / OpenAlex ID: W2089510325 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimax regret solution to linear programming problems with an interval objective function
+Normal rank
@@ Property / cites work @@
+A possibilistic linear program is equivalent to a stochastic linear program in a special case
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4197641
@@ Property / cites work: Q4197641 / rank @@
+Normal rank
@@ Property / cites work @@
+A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank