The lexicographic α-robust knapsack problem

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

zbMATH Keywords

complexity; uncertainty; robustness; 0-1 knapsack problem; min-max (regret)

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem, Schedule robustness in the periodic supply vessels planning problem with stochastic demand and travel time, Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, 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