Name
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. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0167-6377(00)00025-0 | Oper. Res. Lett. |
Keywords | Field | DocType |
bottleneck combinatorial optimization problem,combinatorial optimization problem,general approach,objective function,uncertain objective function coefficient,minimax optimization problem,polynomial algorithms,minimax type,minimax multifacility location problem,maximum weighted tardiness,minmax regret solution,minmax regret optimization,optimization under uncertainty,optimization problem,scheduling problem | Minimax,Combinatorics,Probabilistic-based design optimization,Mathematical optimization,Regret,Quadratic assignment problem,L-reduction,Combinatorial optimization,1-center problem,Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
27 | 2 | Operations Research Letters |
Citations | PageRank | References |
47 | 3.41 | 12 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Averbakh | 1 | 699 | 54.76 |