Pinpointing the complexity of the interval min-max regret knapsack problem
type: Item
instance of: scholarly article
title: Pinpointing the complexity of the interval min-max regret knapsack problem
zbMATH Open document ID: 1241.90178
author: Gerhard J. Woeginger
author: Vladimir G. Deineko
published in: Discrete Optimization
publication date: 2012-06-20T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6048237
zbMATH Keywords: robust optimization
zbMATH Keywords: computational complexity
zbMATH Keywords: polynomial hierarchy
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.03.008
OpenAlex ID: W2094834697
cites work: Robust discrete optimization and its applications
cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey
cites work: Q4298260
cites work: The robust spanning tree problem with interval data
cites work: The polynomial-time hierarchy
DOI: 10.1016/J.DISOPT.2010.03.008
description: scientific article; zbMATH DE number 6048237