An approximation algorithm for interval data minmax regret combinatorial optimization problems
type: Item
instance of: scholarly article
title: An approximation algorithm for interval data minmax regret combinatorial optimization problems
zbMATH Open document ID: 1184.68640
author: Adam Kasperski
author: Paweł Zieliński
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5650193
zbMATH Keywords: robust optimization
zbMATH Keywords: maximal regret
zbMATH Keywords: approximation algorithms
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.11.001
OpenAlex ID: W2051407192
cites work: On the complexity of the robust spanning tree problem with interval data
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: Interval data minmax regret network optimization problems
cites work: Robust discrete optimization and its applications
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: A branch and bound algorithm for the robust shortest path problem with interval data.
cites work: The robust spanning tree problem with interval data
cites work: The computational complexity of the relative robust shortest path problem with interval data
DOI: 10.1016/J.IPL.2005.11.001
description: scientific article; zbMATH DE number 5650193