On a constant factor approximation for minmax regret problems using a symmetry point scenario
type: Item
instance of: scholarly article
title: On a constant factor approximation for minmax regret problems using a symmetry point scenario
zbMATH Open document ID: 1244.90241
author: E. Conde
published in: European Journal of Operational Research
publication date: 2012-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 6066947
zbMATH Keywords: robustness and sensitivity analysis
zbMATH Keywords: minmax-regret models
zbMATH Keywords: constant factor approximation
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.01.005
OpenAlex ID: W1966509452
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: Complexity of robust single facility location problems on networks with uncertain edge lengths.
cites work: Minmax regret linear resource allocation problems.
cites work: An improved algorithm for the minmax regret median problem on a tree
cites work: On the complexity of minmax regret linear programming
cites work: The computational complexity of the criticality problems in a network with interval activity times
cites work: Q4079613
cites work: A minmax regret approach to the critical path method with task interval times
cites work: A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: Some tractable instances of interval data minmax regret problems
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: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
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: A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
cites work: A Benders decomposition approach for the robust spanning tree problem with interval data
cites work: An exact algorithm for the robust shortest path problem with interval data
cites work: A branch and bound algorithm for the robust spanning tree problem with interval data
cites work: The robust shortest path problem with interval data via Benders decomposition
cites work: Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
cites work: The computational complexity of the relative robust shortest path problem with interval data
DOI: 10.1016/J.EJOR.2012.01.005
description: scientific article; zbMATH DE number 6066947