The lexicographic α-robust knapsack problem
From MaRDI portal
Publication:3087844
DOI10.1111/j.1475-3995.2010.00786.xzbMath1219.90142MaRDI QIDQ3087844
Daniel Vanderpooten, Rim Kalai
Publication date: 17 August 2011
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2010.00786.x
90C27: Combinatorial optimization
Related Items
Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria, Complexity results and exact algorithms for robust knapsack problems
Cites Work
- About the applicability of MCDA to some robustness problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robust discrete optimization and network flows
- Approximating Multiobjective Knapsack Problems
- Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results
- Exceptional Paper—Lexicographic Orders, Utilities and Decision Rules: A Survey
- α-Reliable p-minimax regret: A new model for strategic facility location modeling
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications