Minmax regret combinatorial optimization problems: an Algorithmic Perspective
From MaRDI portal
Publication:4917217
DOI10.1051/ro/2011111zbMath1270.90053OpenAlexW2116005283MaRDI QIDQ4917217
Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Nelson F. Maculan
Publication date: 29 April 2013
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://dspace.utalca.cl/handle/1950/8888
Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)
Related Items (12)
The minmax regret robust shortest path problem in a finite multi-scenario model ⋮ An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem ⋮ On exact solutions for the minmax regret spanning tree problem ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Min max min robust (relative) regret combinatorial optimization ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
This page was built for publication: Minmax regret combinatorial optimization problems: an Algorithmic Perspective