Minmax regret combinatorial optimization problems with investments
type: Item
instance of: scholarly article
title: Minmax regret combinatorial optimization problems with investments
zbMATH Open document ID: 1458.90608
author: E. Conde
author: Marina Leal
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 6901444
zbMATH Keywords: minmax regret models
zbMATH Keywords: robustness and sensitivity analysis
zbMATH Keywords: shortest path problem
MaRDI profile type: Publication
full work available at URL: j.cor.2017.03.007
OpenAlex ID: W2598622497
cites work: Complexity of the min-max and min-max regret assignment problems
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Interval data minmax regret network optimization problems
cites work: A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: An approximation algorithm for interval data minmax regret combinatorial optimization problems
cites work: Robust discrete optimization and its applications
cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion
cites work: An exact algorithm for the robust shortest path problem with interval data
DOI: 10.1016/J.COR.2017.03.007
description: scientific article; zbMATH DE number 6901444