Minmax regret combinatorial optimization problems with investments

DOI10.1016/j.cor.2017.03.007zbMath1458.90608OpenAlexW2598622497MaRDI QIDQ1652341

Eduardo Conde, Marina Leal

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.03.007

zbMATH Keywords

shortest path problemrobustness and sensitivity analysisminmax regret models

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items (3)

Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios ⋮ Combinatorial optimization problems with balanced regret ⋮ The supplier selection problem of a manufacturing company using the weighted multi-choice goal programming and MINMAX multi-choice goal programming

Cites Work

• Complexity of the min-max and min-max regret assignment problems
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Robust discrete optimization and its applications
• Interval data minmax regret network optimization problems
• An exact algorithm for the robust shortest path problem with interval data
• Complexity of minimizing the total flow time with interval data and minmax regret criterion

This page was built for publication: Minmax regret combinatorial optimization problems with investments