The Minmax Relative Regret Median Problem on Networks

DOI10.1287/ijoc.1040.0080zbMath1241.90069OpenAlexW1987039917MaRDI QIDQ2892261

Igor Averbakh

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1040.0080

zbMATH Keywords

networksanalysis of algorithmslocationfacilities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete location and assignment (90B80)

Related Items (4)

Robust mean absolute deviation problems on networks with linear vertex weights ⋮ Robust Algorithms for TSP and Steiner Tree ⋮ Computing and minimizing the relative regret in combinatorial optimization with interval data ⋮ Minimax regret path location on trees

This page was built for publication: The Minmax Relative Regret Median Problem on Networks