Robust approach to restricted items selection problem (Q828685): Difference between revisions

@@ Property / DOI @@
-.1007/s11590-020-01626-8
@@ Property / DOI: 10.1007/s11590-020-01626-8 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W3048961104
@@ Property / OpenAlex ID: W3048961104 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09242
@@ Property / arXiv ID: 1907.09242 / 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 @@
+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 @@
+Robust solutions of uncertain linear programs
@@ Property / cites work: Robust solutions of uncertain linear programs / 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 @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+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 @@
+Complexity and in-approximability of a selection problem in robust optimization
+Normal rank
@@ Property / cites work @@
+Min-max and min-max (relative) regret approaches to representatives selection problem
+Normal rank
@@ Property / cites work @@
+Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
+Normal rank
@@ Property / cites work @@
+Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4309474
@@ Property / cites work: Q4309474 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete optimization with interval data. Minmax regret and fuzzy approach
+Normal rank
@@ Property / cites work @@
+Approximability of the robust representatives selection problem
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
+Normal rank
@@ Property / cites work @@
+Exact and heuristic algorithms for the interval data robust assignment problem
+Normal rank
@@ Property / cites work @@
+Robustness in operational research and decision aiding: a multi-faceted issue
+Normal rank
@@ Property / cites work @@
+Q4221106
@@ Property / cites work: Q4221106 / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S11590-020-01626-8
@@ Property / DOI: 10.1007/S11590-020-01626-8 / rank @@
+Normal rank