Min-max and min-max (relative) regret approaches to representatives selection problem

DOI10.1007/s10288-012-0202-3zbMath1266.90191OpenAlexW2044046971MaRDI QIDQ1936659

Sergey Kovalev, Alexandre Dolgui

Publication date: 6 February 2013

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-012-0202-3

zbMATH Keywords

uncertaintycomputational complexitydynamic programmingmin-max regretmin-max approach

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Robustness and adaptive procedures (parametric inference) (62F35) Minimax problems in mathematical programming (90C47) Production models (90B30) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (10)

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty ⋮ Robust approach to restricted items selection problem ⋮ Recoverable robust representatives selection problems with discrete budgeted uncertainty ⋮ Complexity and in-approximability of a selection problem in robust optimization ⋮ Combinatorial optimization problems with balanced regret ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Approximability of the robust representatives selection problem ⋮ Two-stage combinatorial optimization problems under risk ⋮ Optimal control algorithms and their analysis for short-term scheduling in manufacturing systems

Cites Work

• Unnamed Item
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• Combinatorial and robust optimisation models and algorithms for railway applications
• Minimizing the number of late jobs on a single machine under due date uncertainty
• Complexity of the min-max and min-max regret assignment problems
• Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
• On the approximability of minmax (regret) network optimization problems
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Robustness in operational research and decision aiding: a multi-faceted issue
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Robust discrete optimization and its applications
• On the robust shortest path problem.
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• Improving the complexities of approximation algorithms for optimization problems
• A randomized algorithm for the min-Max selecting items problem with uncertain weights
• Optimisation of multi-position machines and transfer lines
• The robust shortest path problem with interval data via Benders decomposition
• The robust shortest path problem in series -- parallel multidigraphs with interval data
• Robust balancing of mixed model assembly line
• Robust portfolio asset allocation and risk measures
• On the complexity of a class of combinatorial optimization problems with uncertainty

This page was built for publication: Min-max and min-max (relative) regret approaches to representatives selection problem