The lexicographic α-robust knapsack problem (Q3087844): Difference between revisions

@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+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 @@
+α-Reliable p-minimax regret: A new model for strategic facility location modeling
+Normal rank
@@ Property / cites work @@
+Approximating Multiobjective Knapsack Problems
@@ Property / cites work: Approximating Multiobjective Knapsack Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
+Normal rank
@@ Property / cites work @@
+About the applicability of MCDA to some robustness problems
+Normal rank
@@ Property / cites work @@
+Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results
+Normal rank
@@ Property / cites work @@
+On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
+Normal rank