Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria
From MaRDI portal
Publication:1926791
DOI10.1016/j.ejor.2012.01.056zbMath1253.91052OpenAlexW2078276584MaRDI QIDQ1926791
Claude Lamboray, Rim Kalai, Daniel Vanderpooten
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.056
Related Items
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop ⋮ Portfolio selection under uncertainty: a new methodology for computing relative‐robust solutions ⋮ Outranking under uncertainty using scenarios ⋮ Recent advances in robust optimization: an overview ⋮ Global minimum variance portfolios under uncertainty: a robust optimization approach
Cites Work
- Unnamed Item
- Locating a competitive facility in the plane with a robustness criterion
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Robustness in operational research and decision aiding: a multi-faceted issue
- Algorithms for robust single and multiple period layout planning for manufacturing systems
- On the lexicographic minimax approach to location problems
- A robustness approach to uncapacitated network design problems
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- Robust discrete optimization and its applications
- On the robust shortest path problem.
- Robust discrete optimization and network flows
- Minmax regret solutions for minimax optimization problems with uncertainty
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints
- A robustness approach to international sourcing
- Choices and kernels in bipolar valued digraphs
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- Robustness in Multi-criteria Decision Aiding
- The lexicographic α-robust knapsack problem
- Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results
- Lexicographicα-robustness: an application to the 1-median problem
- α-Reliable p-minimax regret: A new model for strategic facility location modeling
- Minmax-regret robust 1-median location on a tree
- Robust solutions and methods in decision-aid
- Détermination d'une période économique robuste dans le cadre du modèle de Wilson
- Robust Optimization of Large-Scale Systems
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- Robustness and duality in linear programming
