Minmax regret solutions for minimax optimization problems with uncertainty

Authors:
Igor Averbakh
Affiliations:
Mathematics Department, MS-9063, Western Washington University, Bellingham, Washington 98225, USA
Venue:
Operations Research Letters
Year:
2000

Citing 7
Cited 20

Sensitivity analysis in minisum facility location problems

Operations Research
m-median and m-center problems with mutual communication: solvable special cases

Operations Research - Supplement
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs

Discrete Applied Mathematics
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem

Information Processing Letters
How to use expert advice

Journal of the ACM (JACM)
Minmax Regret Median Location on a Network Under Uncertainty

INFORMS Journal on Computing
Guaranteed performance heuristics for the bottleneck travelling salesman problem

Operations Research Letters

Complexity of robust single facility location problems on networks with uncertain edge lengths

Discrete Applied Mathematics
Interval data minmax regret network optimization problems

Discrete Applied Mathematics
Constraint-based optimization and utility elicitation using the minimax decision criterion

Artificial Intelligence
The Minmax Relative Regret Median Problem on Networks

INFORMS Journal on Computing
Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization

Computers and Operations Research
Improved algorithms for the minmax-regret 1-center and 1-median problems

ACM Transactions on Algorithms (TALG)
Heuristic Algorithms for Solving Uncertain Routing-Scheduling Problem

ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Constraint-based optimization and utility elicitation using the minimax decision criterion

Artificial Intelligence
Improved polynomial algorithms for robust bottleneck problems with interval data

Computers and Operations Research
Minimizing total weighted flow time under uncertainty using dominance and a stability box

Computers and Operations Research
Possibilistic bottleneck combinatorial optimization problems with ill-known weights

International Journal of Approximate Reasoning
Fuzzy parametric programming model for multi-objective integrated solid waste management under uncertainty

Expert Systems with Applications: An International Journal
Schedule execution for two-machine flow-shop with interval processing times

Mathematical and Computer Modelling: An International Journal
Minimizing total weighted flow time of a set of jobs with interval processing times

Mathematical and Computer Modelling: An International Journal
Complexity of single machine scheduling problems under scenario-based uncertainty

Operations Research Letters
Minmax regret bottleneck problems with solution-induced interval uncertainty structure

Discrete Optimization
Facility location problems with uncertainty on the plane

Discrete Optimization
Computing and minimizing the relative regret in combinatorial optimization with interval data

Discrete Optimization
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

Operations Research Letters
"Metro maps of information" by Dafna Shahaf, Carlos Guestrin and Eric Horvitz, with Ching-man Au Yeung as coordinator

ACM SIGWEB Newsletter

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a general approach for finding minmax regret solutions for a class of combinatorial optimization problems with an objective function of minimax type and uncertain objective function coefficients. The approach is based on reducing a problem with uncertainty to a number of problems without uncertainty. The method is illustrated on bottleneck combinatorial optimization problems, minimax multifacility location problems and maximum weighted tardiness scheduling problems with uncertainty.