A linear time algorithm for the robust recoverable selection problem
type: Item
instance of: scholarly article
title: A linear time algorithm for the robust recoverable selection problem
zbMATH Open document ID: 1477.90052
author: Thomas Lachmann
author: Stefan Lendl
author: Gerhard J. Woeginger
published in: Discrete Applied Mathematics
publication date: 2021-09-15T00:00:00Z
Mathematics Subject Classification ID: 90C17
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7395731
zbMATH Keywords: robust optimization
zbMATH Keywords: computational complexity
zbMATH Keywords: selection problem
MaRDI profile type: Publication
full work available at URL: j.dam.2020.08.012
OpenAlex ID: W3083622237
cites work: Time bounds for selection
cites work: Recoverable robust shortest path problems
cites work: On recoverable and two-stage robust selection problems with budgeted uncertainty
cites work: Recoverable robust spanning tree problem under interval uncertainty representations
cites work: The recoverable robust spanning tree problem with interval costs is polynomially solvable
cites work: Robust recoverable and two-stage selection problems
cites work: The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
DOI: 10.1016/J.DAM.2020.08.012
description: scientific article; zbMATH DE number 7395731