Minmax regret solutions for minimax optimization problems with uncertainty

DOI10.1016/S0167-6377(00)00025-0zbMath0988.90026OpenAlexW2058391199MaRDI QIDQ1591541

Publication date: 22 July 2002

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00025-0

zbMATH Keywords

polynomial algorithms minmax regret optimization optimization under uncertainty

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items

An uncertainty management framework for industrial applications, Efficient algorithms for the minmax regret path center problem with length constraint on trees, Lawler's minmax cost algorithm: optimality conditions and uncertainty, Schedule execution for two-machine flow-shop with interval processing times, The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective, Lawler's minmax cost problem under uncertainty, Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria, The two-echelon island fuel distribution problem, Minimizing maximum cost for a single machine under uncertainty of processing times, Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty, A state-of-the-art survey on multi-scenario scheduling, Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations, Min-max relative regret for scheduling to minimize maximum lateness, Minmax regret bottleneck problems with solution-induced interval uncertainty structure, Algorithms and complexity analysis for robust single-machine scheduling problems, Possibilistic bottleneck combinatorial optimization problems with ill-known weights, Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion, Constraint-based optimization and utility elicitation using the minimax decision criterion, Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization, Complexity of single machine scheduling problems under scenario-based uncertainty, Min-max regret robust optimization approach on interval data uncertainty, An enhanced exact procedure for the absolute robust shortest path problem, Minimizing total weighted flow time under uncertainty using dominance and a stability box, Minimizing total weighted flow time of a set of jobs with interval processing times, Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion, Facility location problems with uncertainty on the plane, Risk-averse single machine scheduling: complexity and approximation, Preference elicitation and robust winner determination for single- and multi-winner social choice, Robust supply chain network design with multi-products for a company in the food sector, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Complexity of robust single facility location problems on networks with uncertain edge lengths., Relative Robust and Adaptive Optimization, Computing and minimizing the relative regret in combinatorial optimization with interval data, A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity, Worst‐case allocation algorithms in a complex of operations with interval parameters, Interval data minmax regret network optimization problems, Improved polynomial algorithms for robust bottleneck problems with interval data, The minmax regret permutation flow-shop problem with two jobs

Cites Work