Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
type: Item
instance of: scholarly article
title: Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
zbMATH Open document ID: 1384.90015
author: Igor Averbakh
author: Oded Berman
author: Marina Leal
published in: Discrete Applied Mathematics
publication date: 2018-03-21T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6851671
zbMATH Keywords: minmax regret
zbMATH Keywords: robust location
zbMATH Keywords: facility location under uncertainty
zbMATH Keywords: network algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2017.12.036
OpenAlex ID: W2791683803
cites work: Discrete optimization with interval data. Minmax regret and fuzzy approach
cites work: Robust discrete optimization and its applications
cites work: Robust mean absolute deviation problems on networks with linear vertex weights
cites work: Q5302610
cites work: Q4325546
cites work: On a problem of Davenport and Schinzel
DOI: 10.1016/J.DAM.2017.12.036
description: scientific article; zbMATH DE number 6851671