Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights

DOI10.1016/j.dam.2017.12.036zbMath1384.90015OpenAlexW2791683803MaRDI QIDQ1706134

Marina Leal, Oded Berman, Igor Averbakh

Publication date: 21 March 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.036

zbMATH Keywords

minmax regretnetwork algorithmsfacility location under uncertaintyrobust location

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

Minmax regret maximal covering location problems with edge demands ⋮ Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights

Cites Work

• Unnamed Item
• Unnamed Item
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Robust discrete optimization and its applications
• Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
• On a problem of Davenport and Schinzel
• Robust mean absolute deviation problems on networks with linear vertex weights

This page was built for publication: Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights